![]() |
Volumn 40, Issue 3, 2004, Pages 211-215
|
Diameter and treewidth in minor-closed graph families, revisited
|
Author keywords
Apex graphs; Approximation algorithms; Bounded local treewidth; Graph algorithms; Graph minors
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTER SCIENCE;
FUNCTIONS;
GRAPH THEORY;
MATHEMATICAL MODELS;
PROBLEM SOLVING;
THEOREM PROVING;
TREES (MATHEMATICS);
APEX GRAPH;
APPROXIMATION ALGORITHMS;
BOUNDED LOCAL TREEWIDTH;
GRAPH ALGORITHMS;
GRAPH MINORS;
ALGORITHMS;
|
EID: 13644255055
PISSN: 01784617
EISSN: None
Source Type: Journal
DOI: 10.1007/s00453-004-1106-1 Document Type: Article |
Times cited : (43)
|
References (9)
|