A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162357422 / rank | |||
Normal rank | |||
Revision as of 02:11, 20 March 2024
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
