Drawing graphs in two layers

DOI10.1016/0304-3975(94)90179-1zbMath0819.68086MaRDI 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

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

On the complexity of the maximum biplanar subgraph problem, Curve-constrained drawings of planar graphs, On the parameterized complexity of layered graph drawing, A characterization of level planar graphs, New bounds on the barycenter heuristic for bipartite graph drawing., Crossing-constrained hierarchical drawings

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