2-Layer right angle crossing drawings

Authors:
Emilio Di Giacomo;Walter Didimo;Peter Eades;Giuseppe Liotta
Affiliations:
Università di Perugia, Italy;Università di Perugia, Italy;University of Sydney, Australia;Università di Perugia, Italy
Venue:
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Year:
2011

Citing 9
Cited 4

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Drawing graphs in two layers

Theoretical Computer Science
An Alternative Method to Crossing Minimization on Hierarchical Graphs

SIAM Journal on Optimization
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization

Algorithmica
Drawing Graphs with Right Angle Crossings

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A characterization of complete bipartite RAC graphs

Information Processing Letters
Notes on large angle crossing graphs

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
The straight-line RAC drawing problem is NP-hard

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
The quality ratio of RAC drawings and planar drawings of planar graphs

GD'10 Proceedings of the 18th international conference on Graph drawing

Heuristics for the maximum 2-layer RAC subgraph problem

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Vertex angle and crossing angle resolution of leveled tree drawings

Information Processing Letters
Density of straight-line 1-planar graph drawings

Information Processing Letters
Right angle crossing graphs and 1-planarity

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A 2-layer drawing represents a bipartite graph so that the vertices of each partition set are points of a distinct horizontal line (called a layer) and the edges are straight-line segments. In this paper we study 2-layer drawings where all edge crossings form right angles. We characterize which graphs admit this type of drawing, provide linear-time testing and embedding algorithms, and present a polynomial-time crossing minimization technique. Also, for a given graph G and a constant k, we prove that it is $\mathcal{NP}$-complete to decide whether G contains a subgraph of at least k edges having a 2-layer drawing with right angle crossings.