96 search results - page 2 / 20 » Length-bounded cuts and flows |
CORR
2002
Springer
13 years 5 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
MEMICS
2010
13 years 5 days ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
TALG
2010
13 years 4 days ago
2010
TOC
2008
13 years 5 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
HICSS
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper explores the relationships between power system static collapse and flows in topological cuts. It seeks a “local” detection of this “global” phenomenon. The pap...