Graph drawing : algorithms for the visualization of graphs
Author(s)
Bibliographic Information
Graph drawing : algorithms for the visualization of graphs
Prentice Hall, c1999
Available at 20 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"An Alan R. Apt book."
Includes bibliographical references (p. 359-387) and index
Description and Table of Contents
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.
Table of Contents
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.
by "Nielsen BookData"