A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs |
scientific article |
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
