Graph minors. II. Algorithmic aspects of tree-width (Q3751592): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(86)90023-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029448190 / rank | |||
Normal rank | |||
Latest revision as of 01:37, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph minors. II. Algorithmic aspects of tree-width |
scientific article |
Statements
Graph minors. II. Algorithmic aspects of tree-width (English)
0 references
1986
0 references
contractability
0 references
tree-width
0 references
polynomially bounded algorithm
0 references
planar graph
0 references
polynomial algorithm
0 references
