Flow equivalent trees in undirected node-edge-capacitated planar graphs (Q845841)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Flow equivalent trees in undirected node-edge-capacitated planar graphs |
scientific article; zbMATH DE number 5664701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flow equivalent trees in undirected node-edge-capacitated planar graphs |
scientific article; zbMATH DE number 5664701 |
Statements
Flow equivalent trees in undirected node-edge-capacitated planar graphs (English)
0 references
29 January 2010
0 references
flow equivalent tree
0 references
minimum cut
0 references
node-edge-capacitated
0 references
planar graphs
0 references
graph algorithms
0 references
data structures
0 references
0.9274148
0 references
0.89371544
0 references
0.88482285
0 references
0.8788123
0 references
0.8788123
0 references
0.87676203
0 references
0.8746036
0 references
0.87456506
0 references
0.86774564
0 references
