A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575)
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: A linear-time algorithm for edge-disjoint paths in planar graphs |
scientific article; zbMATH DE number 750664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for edge-disjoint paths in planar graphs |
scientific article; zbMATH DE number 750664 |
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
0.8922436237335205
0 references
0.8909631967544556
0 references
0.8788163661956787
0 references
