A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (Q3569129)
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 5723247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs |
scientific article; zbMATH DE number 5723247 |
Statements
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (English)
0 references
17 June 2010
0 references
spanning caterpillars
0 references
treewidth
0 references
networks topology
0 references
optimization
0 references
0.90397626
0 references
0.9039068
0 references
0.90232253
0 references
0.90232253
0 references
0.9015665
0 references
0.89419556
0 references
0.8911092
0 references
0.8873526
0 references
0.8872669
0 references
