Flow equivalent trees in undirected node-edge-capacitated planar graphs (Q845841): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974774549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3056948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counterexamples for Directed and Node Capacitated Cut-Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4766894 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multi-Terminal Network Flows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum<i>s</i>-<i>t</i>Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time / rank | |||
Normal rank | |||
Latest revision as of 09:57, 2 July 2024
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
