On shortest disjoint paths in planar graphs (Q429668)
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: On shortest disjoint paths in planar graphs |
scientific article; zbMATH DE number 6048242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On shortest disjoint paths in planar graphs |
scientific article; zbMATH DE number 6048242 |
Statements
On shortest disjoint paths in planar graphs (English)
0 references
20 June 2012
0 references
disjoint paths
0 references
shortest path
0 references
planar graph
0 references
objective function
0 references
minimum cost flow
0 references
0 references
0.9953177571296692
0 references
0.8863609433174133
0 references
0.8792097568511963
0 references
0.8782358169555664
0 references
