A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) (Q826071)
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 the arc disjoint Menger problem in planar directed graphs (extended abstract) |
scientific article; zbMATH DE number 7449683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) |
scientific article; zbMATH DE number 7449683 |
Statements
A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) (English)
0 references
20 December 2021
0 references
planar graph
0 references
disjoint path
0 references
linear-time algorithm
0 references
search step
0 references
search path
0 references
0.9930737018585204
0 references
0.992434859275818
0 references
0.8921307921409607
0 references
0.8722437024116516
0 references
