A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396)
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 finding locally connected spanning trees on circular-arc graphs |
scientific article; zbMATH DE number 6162398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs |
scientific article; zbMATH DE number 6162398 |
Statements
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (English)
0 references
13 May 2013
0 references
algorithm
0 references
circular-arc graph
0 references
interval graph
0 references
locally connected spanning tree
0 references
0 references
0 references
0.8941555023193359
0 references
0.867376983165741
0 references
0.8600826859474182
0 references
0.8446338176727295
0 references
