Finding monotone paths in edge-ordered graphs (Q602679)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5810757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding monotone paths in edge-ordered graphs |
scientific article; zbMATH DE number 5810757 |
Statements
Finding monotone paths in edge-ordered graphs (English)
0 references
5 November 2010
0 references
ascent
0 references
monotone path
0 references
\(NP\)-completeness
0 references
complexity
0 references
edge-ordering
0 references
\(k\)-path
0 references
0 references
0.829864501953125
0 references
0.8168818354606628
0 references
0.8152534365653992
0 references
0.8148282766342163
0 references
0.8080610632896423
0 references
