Show simple item record

dc.contributor.authorKhuller, Samiren_US
dc.contributor.authorNaor, Josephen_US
dc.date.accessioned2007-04-23T17:44:47Z
dc.date.available2007-04-23T17:44:47Z
dc.date.issued1990-01en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1089en_US
dc.identifier.urihttps://hdl.handle.net/1813/6929
dc.description.abstractMax-flow in planar graphs has always been studies with the assumption that there are capacities only on the edges. Here we consider a more general version of the problem when the vertices as well as edges have capacity constraints. In the context of general graphs considering only edge capacities in not restrictive, since one can reduce the vertex capacity problem to the edge capacity problem. However, in the case of planar graphs this reduction does not maintain planarity and cannot be used. We study different versions of the planar flow problem (all of which have been extensively investigated in the context of edge capacities).en_US
dc.format.extent2112781 bytes
dc.format.extent588204 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleFlow in Planar Graphs with Vertex Capacitiesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics