Edge crossings in drawings of bipartite graphs
From MaRDI portal
Publication:1322570
DOI10.1007/BF01187020zbMath0804.68107OpenAlexW1972151695WikidataQ56621900 ScholiaQ56621900MaRDI QIDQ1322570
Peter Eades, Nicholas C. Wormald
Publication date: 5 May 1994
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01187020
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Complex systems: features, similarity and connectivity ⋮ Drawing graphs in two layers ⋮ Counting edge crossings in a 2-layered drawing ⋮ PLANET: a radial layout algorithm for network visualization ⋮ Algorithms for multi-level graph planarity testing and layout ⋮ The slotted online one-sided crossing minimization problem on 2-regular graphs ⋮ Drawings of graphs on surfaces with few crossings ⋮ Genetic algorithms for drawing bipartite graphs ⋮ On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ Track Layout Is Hard ⋮ On the 2-layer window width minimization problem ⋮ Drawing (complete) binary tanglegrams ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ Algorithms and bounds for drawing directed graphs ⋮ The Gifi system of descriptive multivariate analysis. ⋮ 2-layer right angle crossing drawings ⋮ Fixed parameter algorithms for one-sided crossing minimization revisited ⋮ Crossing-constrained hierarchical drawings ⋮ Ranking and Drawing in Subexponential Time ⋮ A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs ⋮ Unnamed Item ⋮ A branch-and-cut approach to the crossing number problem ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ On the parameterized complexity of layered graph drawing ⋮ Crossing minimization in extended level drawings of graphs ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ Human-guided search ⋮ Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ Curve-constrained drawings of planar graphs ⋮ On the complexity of the maximum biplanar subgraph problem ⋮ Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation ⋮ Comparing trees via crossing minimization ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ k-Level Crossing Minimization Is NP-Hard for Trees ⋮ On the complexity of crossings in permutations ⋮ A linear edge kernel for two-layer crossing minimization ⋮ Heuristics and meta-heuristics for 2-layer straight line crossing minimization ⋮ Connecting the dots (with minimum crossings) ⋮ Bipartite Graph Representation of Multiple Decision Table Classifiers ⋮ A New Framework for Hierarchical Drawings ⋮ A new lower bound for the bipartite crossing number with applications ⋮ Crossing minimization in weighted bipartite graphs ⋮ Bubblesearch: a simple heuristic for improving priority-based greedy algorithms ⋮ Right Angle Crossing Drawings of Graphs ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ New bounds on the barycenter heuristic for bipartite graph drawing. ⋮ A tabu search algorithm for the bipartite drawing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of planar ordered sets
- Algorithms for drawing graphs: An annotated bibliography
- Crossing Number is NP-Complete
- DAG—a program that draws directed graphs
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Crossing Theory and Hierarchy Mapping
