A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162357422 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1202.2624 / rank | |||
Normal rank | |||
Latest revision as of 02:03, 20 April 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
