A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms (Q5189527): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Peter Rossmanith / rank | |||
| Property / author | |||
| Property / author: Peter Rossmanith / rank | |||
Normal rank | |||
| 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.1137/080715482 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081438146 / rank | |||
Normal rank | |||
Latest revision as of 18:14, 19 March 2024
scientific article; zbMATH DE number 5682416
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms |
scientific article; zbMATH DE number 5682416 |
Statements
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms (English)
0 references
17 March 2010
0 references
graph algorithms
0 references
graph theory
0 references
algorithm
0 references
pathwidth
0 references
