![]() |
Volumn 2832, Issue , 2003, Pages 765-775
|
A linear time heuristic for the branch-decomposition of planar graphs
|
Author keywords
[No Author keywords available]
|
Indexed keywords
GRAPHIC METHODS;
OPTIMIZATION;
BIPARTITE GRAPHS;
BRANCH DECOMPOSITION;
GENERAL GRAPH;
LINEAR TIME;
MAXIMUM DISTANCE;
PLANAR DRAWING;
PLANAR GRAPH;
TEST INSTANCES;
GRAPH THEORY;
|
EID: 0142183752
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-39658-1_68 Document Type: Article |
Times cited : (16)
|
References (12)
|