On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. In Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 5th International Workshop, WADS 97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. Volume 1272 of Lecture Notes in Computer Science, pages 55-68, Springer, 1997.

Abstract

Abstract is missing.