
Graph Drawing
Algorithms for the Visualization of Graphs
Pearson (Publisher)
Published on 10. August 1998
Book
Hardback
416 pages
978-0-13-301615-4 (ISBN)
Description
Designed for use in a variety of courses including Information Visualization, Human-Computer Interaction, Graph Algorithms, Computational Geometry, and Graph Drawing.
This book describes fundamental algorithmic techniques for constructing drawings of graphs. Suitable as either a textbook or reference manual, its chapters offer an accurate, accessible reflection of the rapidly expanding field of graph drawing. The authors are well-recognized researchers in the field of data structures and algorithms. In particular, their pioneering work on graph drawing has given momentum to this expanding field.
This book describes fundamental algorithmic techniques for constructing drawings of graphs. Suitable as either a textbook or reference manual, its chapters offer an accurate, accessible reflection of the rapidly expanding field of graph drawing. The authors are well-recognized researchers in the field of data structures and algorithms. In particular, their pioneering work on graph drawing has given momentum to this expanding field.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 182 mm
Width: 242 mm
Thickness: 19 mm
Weight
649 gr
ISBN-13
978-0-13-301615-4 (9780133016154)
Schweitzer Classification
Content
1. Graphs and Their Drawings.
2. Paradigms for Graph Drawing.
3. Divide and Conquer.
4. Planar Orientations.
5. Flow and Orthogonal Drawings.
6. Flow and Upward Planarity.
7. Incremental Construction.
8. Nonplanar Orientations.
9. Layered Drawings of Digraphs.
10. Force Directed Methods.
11. Proving Lower Bounds.
Appendix: A Bounds.
Bibliography.
Index.
2. Paradigms for Graph Drawing.
3. Divide and Conquer.
4. Planar Orientations.
5. Flow and Orthogonal Drawings.
6. Flow and Upward Planarity.
7. Incremental Construction.
8. Nonplanar Orientations.
9. Layered Drawings of Digraphs.
10. Force Directed Methods.
11. Proving Lower Bounds.
Appendix: A Bounds.
Bibliography.
Index.