Name
Title | ||
|---|---|---|
Maximum flow is approximable by deterministic constant-time algorithm in sparse networks |
Abstract | ||
|---|---|---|
We show a deterministic constant-time parallel algorithm for finding an
almost maximum flow in multisource-multitarget networks with bounded degrees
and bounded edge capacities. As a consequence, we show that the value of the
maximum flow over the number of nodes is a testable parameter on these
networks. |
Year | Venue | Keywords |
|---|---|---|
2010 | Clinical Orthopaedics and Related Research | data structure,maximum flow,parallel algorithm |
Field | DocType | Volume |
Flow network,Push–relabel maximum flow algorithm,Discrete mathematics,Combinatorics,Parallel algorithm,Maximum flow problem,Mathematics,Bounded function | Journal | abs/1005.0 |
Citations | PageRank | References |
1 | 0.35 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Csóka | 1 | 44 | 6.42 |