A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:43, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for edge-disjoint paths in planar graphs |
scientific article |
Statements
A linear-time algorithm for edge-disjoint paths in planar graphs (English)
0 references
14 July 1996
0 references
linear-time algorithm
0 references
planar graphs
0 references
edge-disjoint paths
0 references
evenness condition
0 references
theorem of Okamura and Seymour
0 references
