Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (Q5891346): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.7155/jgaa.00246 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008864968 / rank | |||
Normal rank | |||
Latest revision as of 22:29, 19 March 2024
scientific article; zbMATH DE number 6234169
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem |
scientific article; zbMATH DE number 6234169 |
Statements
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (English)
0 references
28 November 2013
0 references
non-sparse graph classes
0 references
constant-factor approximation algorithm for cographs
0 references
linear-time algorithm for chordal cographs
0 references
spanning tree congestion
0 references
