This book constitutes the refereed proceedings of the international Symposium on Graph Drawing, GD '95, held in Passau, Germany, in September 1995. The 40 full papers and 12 system demonstrations were selected from a total of 88 submissions and include, in their revised versions presented here, the improvements suggested during the meeting. This book also contains a report on the graph-drawing contest held in conjunction with GD '95. Graph drawing is concerned with the problem of visualizing structural information, particularly by constructing geometric representations of abstract graphs and networks. The importance of this area for industrial applications is testified by the large number of people with industrial affiliations, submitting papers and participating in the meeting.
Graph Drawing
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
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:
We say that an undirected graph G(V, E) without loops or parallel edges is drawn in the plane if each vertex v V is represented by a distinct point and each edge e E is represented by a Jordan arc connecting the points corresponding to endpoints of e. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
grid intersection graphs, forced vertex, adaptive layout algorithm, hexagonal realization, unimaximal subsequence, numbering testing, triangulated plane graph, upward numbering, touching graphs, graphs nicely using simulated annealing, contact graphs, graph drawing aesthetics, upward planarity testing, proper local minimum, algorithmic paths, graph drawing systems, manhattan layout, improving swap, pairwise crossing edges, hull tree, orthogonal graph drawings, heuristic for graph drawing, interactive graph drawing, proximity drawability, drawing general undirected graphs Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, New York, Graph Layout Toolkit, New Jersey, Diagram Server, International Workshop, Discrete Math, Tom Sawyer Software, Congressus Numerantium, Bary Median Stoch Gre-ins Gre-swi Split, Combinatorial Model, University of Newcastle, Academic Press, Brown University, City University, Combinatorial Theory, National Science Foundation, University of Queensland, Springer Verlag, Theory of Computing, Theory Ser, University of British Columbia, Cambridge University Press, David Krackhardt, Discrete Comput New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
We say that an undirected graph G(V, E) without loops or parallel edges is drawn in the plane if each vertex v V is represented by a distinct point and each edge e E is represented by a Jordan arc connecting the points corresponding to endpoints of e. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
grid intersection graphs, forced vertex, adaptive layout algorithm, hexagonal realization, unimaximal subsequence, numbering testing, triangulated plane graph, upward numbering, touching graphs, graphs nicely using simulated annealing, contact graphs, graph drawing aesthetics, upward planarity testing, proper local minimum, algorithmic paths, graph drawing systems, manhattan layout, improving swap, pairwise crossing edges, hull tree, orthogonal graph drawings, heuristic for graph drawing, interactive graph drawing, proximity drawability, drawing general undirected graphs Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, New York, Graph Layout Toolkit, New Jersey, Diagram Server, International Workshop, Discrete Math, Tom Sawyer Software, Congressus Numerantium, Bary Median Stoch Gre-ins Gre-swi Split, Combinatorial Model, University of Newcastle, Academic Press, Brown University, City University, Combinatorial Theory, National Science Foundation, University of Queensland, Springer Verlag, Theory of Computing, Theory Ser, University of British Columbia, Cambridge University Press, David Krackhardt, Discrete Comput 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 61
books:
See all 61 books this book cites
- Graph Drawing by Stephen G. Kobourov on 4 pages
- Applied Mathematics by Cohen on page 110, page 223, and page 408
- Software Engineering by H. Freeman on page 51, and page 481
- Combinatorial Algorithms for Integrated Circuit Layout (Wiley Teubner Series on Applicable Theory in Computer Science) by Thomas Lengauer on page 265, and page 430
- The Algorithmic Beauty of Plants (The Virtual Laboratory) by Przemyslaw Prusinkiewicz on page 167, and page 177
See all 61 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
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Software Engineering > Methodology
- Books > Computers & Technology > Graphic Design > CAD
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Graphics & Multimedia
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Graphics & Visualization
- Books > New & Used Textbooks > Computer Science > Software Design & Engineering
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
