FOCS
1994
IEEE
15 years 3 months ago
1994
IEEE
This paper concerns the open problem of Lov
GD
2009
Springer
15 years 3 months ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
80
Voted
MFCS
2007
Springer
15 years 5 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...