Flow equivalent trees in undirected node-edge-capacitated planar graphs (Q845841)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Flow equivalent trees in undirected node-edge-capacitated planar graphs |
scientific article |
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
