Ioannis G. Tollis, University of Texas, Dallas
Giuseppe Di Battista, Terza Universita di Roma
Peter Eades, University of Newcastle
Roberto Tamassia, Brown University
©1999 |Pearson | Available
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.
World Wide Web site maps.
Browsing history diagrams.
Software engineering data flow diagrams.
Database systems.
Real time systems.
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.
Pearson offers special pricing when you package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson rep.
Tollis, Di Battista, Eades & Tamassia
©1999 | Pearson | 397 pp
We're sorry! We don't recognize your username or password. Please try again.
The work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning.
You have successfully signed out and will be required to sign back in should you need to download more resources.