Algorithm for two disjoint long paths in 2-connected graphs (Q986559)
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: Algorithm for two disjoint long paths in 2-connected graphs |
scientific article; zbMATH DE number 5768918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for two disjoint long paths in 2-connected graphs |
scientific article; zbMATH DE number 5768918 |
Statements
Algorithm for two disjoint long paths in 2-connected graphs (English)
0 references
11 August 2010
0 references
path
0 references
degree sum
0 references
dominating path
0 references
0.8051950931549072
0 references
0.7908918857574463
0 references
0.7869449853897095
0 references
