A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591)
From MaRDI portal
scientific article; zbMATH DE number 6282650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph |
scientific article; zbMATH DE number 6282650 |
Statements
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (English)
0 references
10 April 2014
0 references
graph minor
0 references
algorithm
0 references
