A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243)
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 simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs |
scientific article; zbMATH DE number 6585490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs |
scientific article; zbMATH DE number 6585490 |
Statements
A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (English)
0 references
26 May 2016
0 references
combinatorial problems
0 references
flow
0 references
residual graph
0 references
edge-disjoint paths
0 references
planar graphs
0 references
clockwise circuit
0 references
counterclockwise circuit
0 references
0.9532792568206788
0 references
0.9529290199279784
0 references
0.8788163661956787
0 references
0.8605992794036865
0 references
