2-layer right angle crossing drawings
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)
- scientific article; zbMATH DE number 3963860 (Why is no real title available?)
- scientific article; zbMATH DE number 3412664 (Why is no real title available?)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- 2-layer right angle crossing drawings
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- A characterization of complete bipartite RAC graphs
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- A fixed-parameter approach to 2-layer planarization
- An alternative method to crossing minimization on hierarchical graphs
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing Graphs with Right Angle Crossings
- Drawing graphs in two layers
- Drawing graphs with right angle crossings
- Edge crossings in drawings of bipartite graphs
- Graph Drawing and Applications for Software and Knowledge Engineers
- Graphs that admit right angle crossing drawings
- Heuristics for the maximum 2-layer RAC subgraph problem
- Network flows. Theory, algorithms, and applications.
- Notes on large angle crossing graphs
- On the perspectives opened by right angle crossing drawings
- On the size of graphs that admit polyline drawings with few bends and crossing angles
- Right angle crossing graphs and 1-planarity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The crossing-angle resolution in graph drawing
- The quality ratio of RAC drawings and planar drawings of planar graphs
- The straight-line RAC drawing problem is NP-hard
- Fan-planarity: properties and complexity
- On RAC drawings of graphs with one bend per edge
- 2-Layer k-Planar Graphs
- 2-Layer Graph Drawings with Bounded Pathwidth
- On RAC drawings of graphs with one bend per edge
- Drawing graphs with right angle crossings
- A heuristic approach towards drawings of graphs with high crossing resolution
- Fixed-parameter algorithms for computing RAC drawings of graphs
- Quantum graph drawing (best student paper)
- Heuristics for the maximum 2-layer RAC subgraph problem
- Two-layer drawings of bipartite graphs
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
- Beyond planar graphs: introduction
- Right Angle Crossing Drawings of Graphs
- 2-layer right angle crossing drawings
- scientific article; zbMATH DE number 7651192 (Why is no real title available?)
- The stub resolution of 1-planar 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)
