A linear time algorithm for computing longest paths in 2-trees. (Q2936680)
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 computing longest paths in 2-trees. |
scientific article; zbMATH DE number 6383825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for computing longest paths in 2-trees. |
scientific article; zbMATH DE number 6383825 |
Statements
6 January 2015
0 references
algorithmic graph theory
0 references
longest path
0 references
treewidth
0 references
2-tree
0 references
0.7992199659347534
0 references
0.7948639988899231
0 references
0.792999804019928
0 references
0.7880181074142456
0 references
0.7854679226875305
0 references
