Edge crossings in drawings of bipartite graphs
From MaRDI portal
Publication:1322570
DOI10.1007/BF01187020zbMath0804.68107WikidataQ56621900 ScholiaQ56621900MaRDI QIDQ1322570
Peter Eades, Nicholas C. Wormald
Publication date: 5 May 1994
Published in: Algorithmica (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, Genetic algorithms for drawing bipartite graphs, On the complexity of the maximum biplanar subgraph problem, Algorithms for multi-level graph planarity testing and layout, Curve-constrained drawings of planar graphs, Fixed parameter algorithms for one-sided crossing minimization revisited, A branch-and-cut approach to the crossing number problem, On the parameterized complexity of layered graph drawing, Drawing graphs in two layers, The Gifi system of descriptive multivariate analysis., A new lower bound for the bipartite crossing number with applications, A tabu search algorithm for the bipartite drawing problem, On the one-sided crossing minimization in a bipartite graph with large degrees, Heuristics and meta-heuristics for 2-layer straight line crossing minimization, New bounds on the barycenter heuristic for bipartite graph drawing., Drawings of graphs on surfaces with few crossings, Crossing-constrained hierarchical drawings, Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
