𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Electric routing and concurrent flow cutting

✍ Scribed by Jonathan Kelner; Petar Maymounkov

Book ID
108281659
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
311 KB
Volume
412
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sparsest cuts and concurrent flows in pr
Sparsest cuts and concurrent flows in product graphs
✍ Paul Bonsma πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 300 KB

A cut [S; S] is a sparsest cut of a graph G if its cut value |S S|=|[S; S]| is maximum (this is the reciprocal of the well-known edge-density of the cut). In the (undirected) uniform concurrent ow problem on G, between every vertex pair of G ow paths with a total ow of 1 have to be established. The

Multiterminal flows and cuts
Multiterminal flows and cuts
✍ David Hartvigsen; FranΓ§ois Margot πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 296 KB