This book constitutes the strictly refereed post-conference proceedings of the International Symposium on Graph Drawing, GD'96, held in Berkeley, California, in September 1996. The 24 revised full papers and the 8 systems demonstrations presented in the book were carefully selected from a total of 50 papers and 24 demos submitted. Also included is a summary of the annual graph drawing competition. Among the topics covered are planarity, upward and orthogonal drawing, heuristics, experimental results, and graph drawing systems.
Graph Drawing
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
claw inequalities, octagon graph, external facial cycle, positive arc costs, connected outerplanar graphs, constrained graph layout, graph layout model, local degree one, aesthetic cost function, connected clustered graph, noncollinear layout, labeling assignment, dimensional plane drawing, greedy linear extension, reduced vertices, planarization problem, admissible network, weak layout, subtree separation, planar subgraph problem, interval layout, orthogonal grid drawing, serial interconnection, bounds for orthogonal drawings, hierarchical drawing Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Circular Library, Springer Verlag, Peter Eades, Tom Sawyer Software, Brown University, International Workshop, University of Newcastle, Qing-Wen Feng, Theory Appl, Information Processing Letters, New Jersey, New York, Berlin Heidelberg, Algorithm Form-pairs, National Science Foundation, Proceedings of Graph, Universität Karlsruhe, Army Research Office, Discrete Comput, Discrete Mathematics, European Symposium, Graph Theoretic Concepts, Hearst Avenue, Hierarchical Library New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
claw inequalities, octagon graph, external facial cycle, positive arc costs, connected outerplanar graphs, constrained graph layout, graph layout model, local degree one, aesthetic cost function, connected clustered graph, noncollinear layout, labeling assignment, dimensional plane drawing, greedy linear extension, reduced vertices, planarization problem, admissible network, weak layout, subtree separation, planar subgraph problem, interval layout, orthogonal grid drawing, serial interconnection, bounds for orthogonal drawings, hierarchical drawing Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Circular Library, Springer Verlag, Peter Eades, Tom Sawyer Software, Brown University, International Workshop, University of Newcastle, Qing-Wen Feng, Theory Appl, Information Processing Letters, New Jersey, New York, Berlin Heidelberg, Algorithm Form-pairs, National Science Foundation, Proceedings of Graph, Universität Karlsruhe, Army Research Office, Discrete Comput, Discrete Mathematics, European Symposium, Graph Theoretic Concepts, Hearst Avenue, Hierarchical Library New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 38
books:
See all 38 books this book cites
- Graph Drawing by Stephen G. Kobourov on 7 pages
- Discrete Mathematics by Wiley on page 333, and page 354
- World Dynamics by Jay W. Forrester on page 198, and page 200
- Ordered Sets (NATO Science Series C: (closed)) by Ivan Rival on page 11, and page 24
- Data Structures: WITH JBuilder 3.5 Compiler by Michael T. Goodrich on page 62, and page 197
See all 38 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
