This book contains Volume 6 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design. Graph Algorithms and Applications 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2000). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.
FREE Two-Day Shipping for Students. Learn more |
|
There is a newer edition of this item:
|
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:
This special issues features contributions based on five of the papers and one of the invited talks presented at GD'99 at Stirin Castle in the vicinity of Prague, Czech Republic. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
level planar embedding, scan pebble, reduced extended forms, pertinent subtree, outer facial cycle, inner facial cycles, level planarity, maximal inseparable, lower subpath, podevsnef model, sink indicators, infinite triangular lattice, edge augmentation, ignored nodes, average correctness, virtual vertices, full point set, orthogonal graph drawing, toroidal graph, mode correctness, direct siblings, overlap constraints, layout aesthetics, edge traversals, planarity test Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Torus Graph Family, Fast Drawing of Large Graphs, Springer Verlag, Traversing Eulerian Mazes, Rational Rose, Michael Kaufmann, Ossona de Mendez, Realization of Posets, Czech Republic, Merge Condition, Discrete Mathematics, Prentice Hall, The Weizmann Institute of Science, Information Processing Letters, International Workshop, Israel Inst, Theory Appl New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
This special issues features contributions based on five of the papers and one of the invited talks presented at GD'99 at Stirin Castle in the vicinity of Prague, Czech Republic. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
level planar embedding, scan pebble, reduced extended forms, pertinent subtree, outer facial cycle, inner facial cycles, level planarity, maximal inseparable, lower subpath, podevsnef model, sink indicators, infinite triangular lattice, edge augmentation, ignored nodes, average correctness, virtual vertices, full point set, orthogonal graph drawing, toroidal graph, mode correctness, direct siblings, overlap constraints, layout aesthetics, edge traversals, planarity test Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Torus Graph Family, Fast Drawing of Large Graphs, Springer Verlag, Traversing Eulerian Mazes, Rational Rose, Michael Kaufmann, Ossona de Mendez, Realization of Posets, Czech Republic, Merge Condition, Discrete Mathematics, Prentice Hall, The Weizmann Institute of Science, Information Processing Letters, International Workshop, Israel Inst, Theory Appl New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 32
books:
See all 32 books this book cites
- Graph Drawing by Stephen G. Kobourov on 12 pages
- Graph Algorithms (Computer Software Engineering Series) by Shimon Even in Front Matter, page 157, and page 171
- Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel on page 65, page 310, and Back Matter
- Graph Algorithms And Applications by Giuseppe Liotta in Front Matter, and page 253
- Combinatorial Algorithms for Integrated Circuit Layout (Wiley Teubner Series on Applicable Theory in Computer Science) by Thomas Lengauer on page 128, and page 338
See all 32 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. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
