Skip to main content
Conference Proceedings

Drawing bipartite graphs in two layers with specified crossings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11394 LNCS 97-108
DOI: 10.1007/978-3-030-11509-8_9
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a polynomial-time algorithm to decide whether a bipartite graph admits a two-layer drawing in the plane such that a specified subset of pairs of edges cross. This is a generalization of the problem of recognizing permutation graphs, and we generalize the characterization of permutation graphs.

Author supplied keywords

Cite

CITATION STYLE

APA

Diwan, A. A., Roy, B., & Ghosh, S. K. (2019). Drawing bipartite graphs in two layers with specified crossings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11394 LNCS, pp. 97–108). Springer Verlag. https://doi.org/10.1007/978-3-030-11509-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free