Abstract
A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn straight. The 2-Layer Planarization problem asks if k edges can be deleted from a given graph G so that the remaining graph is biplanar. This problem is NP-complete, as is the 1-Layer Planarization problem in which the permutation of the vertices in one layer is fixed. We give the following fixed parameter tractability results: an O(k · 6k + |G|) algorithm for 2-Layer Planarization and an O(3k · |G|) algorithm for 1-Layer Planarization, thus achieving linear time for fixed k. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Dujmovic, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., … Wood, D. R. (2002). A fixed-parameter approach to two-layer planarization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2265 LNCS, pp. 1–15). Springer Verlag. https://doi.org/10.1007/3-540-45848-4_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
