Diameter and treewidth in minor-closed graph families (Q1578412): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s004530010020 / 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S004530010020 / rank | |||
Normal rank | |||
Latest revision as of 21:51, 10 December 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
