Diameter and treewidth in minor-closed graph families (Q1578412): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/algorithmica/Eppstein00, #quickstatements; #temporary_batch_1731483406851 |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: David Eppstein / rank | |||
| Property / author | |||
| Property / author: David Eppstein / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067431706 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/9907126 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56235108 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/algorithmica/Eppstein00 / rank | |||
Normal rank | |||
Revision as of 08:52, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Diameter and treewidth in minor-closed graph families |
scientific article |
Statements
Diameter and treewidth in minor-closed graph families (English)
0 references
27 August 2000
0 references
tree decomposition
0 references
planar graph
0 references
diameter
0 references
treewidth
0 references
graph algorithms
0 references
apex graph
0 references
approximation algorithms
0 references
subgraph isomorphism algorithms
0 references
