Drawing graphs in two layers

Theoretical Computer Science

Volumn 131, Issue 2, 1994, Pages 361-374

  Eades, Peter ^a   Whitesides, Sue ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; SET THEORY;

BIPARTITE GRAPH; BIPLANAR; EDGE SET; VERTEX SET; VERTICES;

DRAWING (GRAPHICS);

EID: 0028501027     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90179-1     Document Type: Article

References (26)

1. Fast probabilistic algorithms for Hamilton circuits and matchings
2. An efficient algorithm for maxdominance with applications
3. Some beautiful arguments using mathematical induction
4. Heuristics for reducing crossings in 2-layered networks
5. How to draw a directed graph
6. On an edge crossing problem
7. How to draw a directed graph
8. Algorithms for drawing graphs: an annotated bibliography
9. Edge crossings in drawings of bipartite graphs
10. DAG — a program that draws directed graphs
11. Crossing number is NP-complete
12. A recursive algorithm for drawing hierarchical directed graphs
13. On approximating the longest path in a graph
14. A view to graph layout problems
15. An optimal algorithm for the maximum two-chain problem
16. Experiments in drawing 2-level hierarchical graphs
17. Automatic layout of large directed graphs
18. An algorithm for the determination of a longest increasing subsequence in a sequence
19. EDGE an extendible directed graph editor
20. A browser for directed graphs
21. A cognitive approach for graph drawing
22. Visualizing structural information: hierarchical drawing of a compound digraph
23. Methods for visual understanding of hierarchical system structures