|
Volumn 5417 LNCS, Issue , 2009, Pages 336-347
|
Two polynomial time algorithms for the metro-line crossing minimization problem
|
Author keywords
[No Author keywords available]
|
Indexed keywords
DRAWING (GRAPHICS);
POLYNOMIAL APPROXIMATION;
CORRESPONDING VERTICES;
EMBEDDED GRAPHS;
IMPROVE-A;
MAIN TASKS;
METRO LINES;
METRO MAPS;
POLYNOMIAL-TIME ALGORITHMS;
PUBLIC TRANSPORTATION NETWORKS;
GRAPH THEORY;
|
EID: 68749114442
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-642-00219-9_33 Document Type: Conference Paper |
Times cited : (9)
|
References (9)
|