Drawing graphs in two layers

DOI10.1016/0304-3975(94)90179-1zbMath0819.68086OpenAlexW2021813567MaRDI QIDQ1331939

Peter Eades, S. H. Whitesides

Publication date: 29 August 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90179-1

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (21)

Layered drawing of undirected graphs with generalized port constraints ⋮ Parameterized analysis and crossing minimization problems ⋮ Two-layer planarization parameterized by feedback edge set ⋮ On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ Two-layer drawings of bipartite graphs ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ One-sided weak dominance drawing ⋮ 2-layer right angle crossing drawings ⋮ Crossing-constrained hierarchical drawings ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ On the parameterized complexity of layered graph drawing ⋮ Noncrossing monochromatic subtrees and staircases in 0-1 matrices ⋮ On the planarization of wireless sensor networks ⋮ Curve-constrained drawings of planar graphs ⋮ On the complexity of the maximum biplanar subgraph problem ⋮ Comparing trees via crossing minimization ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ Connecting the dots (with minimum crossings) ⋮ A characterization of level planar graphs ⋮ New bounds on the barycenter heuristic for bipartite graph drawing. ⋮ Layered Drawing of Undirected Graphs with Generalized Port Constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the longest path in a graph
• An efficient algorithm for maxdominance, with applications
• An algorithm for the determination of longest increasing subsequence in a sequence
• Some beautiful arguments using mathematical induction
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Edge crossings in drawings of bipartite graphs
• Algorithms for drawing graphs: An annotated bibliography
• Crossing Number is NP-Complete
• DAG—a program that draws directed graphs
• Experiments on drawing 2-level hierarchical graphs

This page was built for publication: Drawing graphs in two layers