Handbook of graph drawing and visualization / [edited by] Roberto Tamassia.
Material type:
- 9781584884125 (hardcover : alk. paper)
- 511.5 23 T153
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 511.5 T153 (Browse shelf(Opens below)) | Available | 135728 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
No cover image available | ||||||||
511.5 T153 Graph algorithms and applications I | 511.5 T153 Graph algorithms and applications 4 | 511.5 T153 Graph algorithms and applications 5 | 511.5 T153 Handbook of graph drawing and visualization / | 511.5 T282 Graph theory and applications | 511.5 T588 Computational graph theory | 511.5 T639 Introduction to Ramsey spaces |
Includes bibliographical references and index.
1. Planarity Testing and Embedding
2. Crossings and Planarization
3. Symmetric Graph Drawing
4. Proximity Drawings
5. Tree Drawing Algorithms
6. Planar Straight-Line Drawing Algorithms
7. Planar orthogonal and polyline drawing algorithms
8. Spine and Radial Drawings
9. Circular Drawing Algorithms
10. Rectangular Drawing Algorithms
11. Simultaneous Embedding of Planar Graphs
12. Force-Directed Drawing Algorithms
13. Hierarchical Drawing Algorithms
14. Three-Dimensional Drawings
15. Labeling Algorithms
16. Graph Markup Language (GraphML)
17. The Open Graph Drawing Framework (OGDF)
18. GDToolkit
19. PIGALE
20. Biological Networks
21. Computer Security
22. Graph Drawing for Data Analytics
23. Graph drawing and cartography
24. Graph Drawing in Education
25. Computer Networks
26. Social Networks
Index.
Presents a comprehensive survey of the field of graph drawing, from its combinatorial and geometric foundations to its applications in various areas of the physical, life, and social sciences. This book covers combinatorial, geometric, and algorithmic foundations. It also presents various graph drawing algorithms as well as graph drawing systems.
There are no comments on this title.