Journal of Graph Algorithms and Applications
http://jgaa.info ISSN: 1526-1719
DOI: 10.7155/jgaa.00106 Two-Layer Planarization: Improving on Parameterized Algorithmics Henning Fernau Vol. 9, no. 2, pp. 205-238, 2005. Regular paper Abstract A bipartite graph is biplanar if the vertices can be placed on two parallel lines in the plane such that there are no edge crossings when edges are drawn as straight-line segments connecting vertices on one line to vertices on the other line. We study two problems:
|
Revised: September 2005. Submitted: October 2004. Communicated by Giuseppe Liotta |
Journal of Graph Algorithms and Applications |