Diameter and treewidth in minor-closed graph families (Q1578412): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56235108, #quickstatements; #temporary_batch_1719272490319 |
Created claim: DBLP publication ID (P1635): journals/algorithmica/Eppstein00, #quickstatements; #temporary_batch_1731483406851 |
||
| 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
