A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (Q3569129): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-13284-1_19 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1516348081 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs |
scientific article |
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
