2-layer right angle crossing drawings
DOI10.1007/S00453-012-9706-7zbMATH Open1303.05129OpenAlexW2054401820WikidataQ62042385 ScholiaQ62042385MaRDI QIDQ476445FDOQ476445
Authors: Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta 
Publication date: 2 December 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9706-7
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Crossing-Angle Resolution in Graph Drawing
- Graph Drawing and Applications for Software and Knowledge Engineers
- Drawing graphs with right angle crossings
- The straight-line RAC drawing problem is NP-hard
- 2-layer right angle crossing drawings
- Drawing Graphs with Right Angle Crossings
- Right angle crossing graphs and 1-planarity
- A characterization of complete bipartite RAC graphs
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Drawing graphs in two layers
- A fixed-parameter approach to 2-layer planarization
- An alternative method to crossing minimization on hierarchical graphs
- Notes on large angle crossing graphs
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- On the size of graphs that admit polyline drawings with few bends and crossing angles
- Graphs that admit right angle crossing drawings
- The quality ratio of RAC drawings and planar drawings of planar graphs
- On the perspectives opened by right angle crossing drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Edge crossings in drawings of bipartite graphs
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- Heuristics for the maximum 2-layer RAC subgraph problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (19)
- The Stub Resolution of 1-planar Graphs
- Beyond Planar Graphs: Introduction
- Right Angle Crossing Drawings of Graphs
- Title not available (Why is that?)
- Quantum graph drawing (best student paper)
- A heuristic approach towards drawings of graphs with high crossing resolution
- Recognizing and drawing IC-planar graphs
- Drawing graphs with right angle crossings
- 2-layer right angle crossing drawings
- 2-Layer k-Planar Graphs
- 2-Layer Graph Drawings with Bounded Pathwidth
- Fixed-parameter algorithms for computing RAC drawings of graphs
- On RAC drawings of graphs with one bend per edge
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
- Fan-planarity: properties and complexity
- On RAC drawings of 1-planar graphs
- On RAC drawings of graphs with one bend per edge
- Heuristics for the maximum 2-layer RAC subgraph problem
- 1-fan-bundle-planar drawings of graphs
This page was built for publication: 2-layer right angle crossing drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476445)
