A simpler algorithm and shorter proof for the graph minor decomposition (Q5419115): 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.1145/1993636.1993697 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998811202 / rank | |||
Normal rank | |||
Latest revision as of 01:58, 20 March 2024
scientific article; zbMATH DE number 6301169
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simpler algorithm and shorter proof for the graph minor decomposition |
scientific article; zbMATH DE number 6301169 |
Statements
A simpler algorithm and shorter proof for the graph minor decomposition (English)
0 references
5 June 2014
0 references
disjoint paths problem
0 references
graph algorithms
0 references
graph minors
0 references
