On computing longest paths in small graph classes (Q3065608)
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 5833099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing longest paths in small graph classes |
scientific article; zbMATH DE number 5833099 |
Statements
ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (English)
0 references
6 January 2011
0 references
algorithmic graph theory
0 references
design and analysis of algorithms
0 references
graph classes
0 references
longest path problem
0 references
0 references
0.93446546792984
0 references
0.8489638566970825
0 references
0.8298047184944153
0 references
0.8295775651931763
0 references
0.8173921704292297
0 references
