Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$101.58
Used and New from Other Sellers
Used and New from Other Sellers
from $34.58
Usually ships in 1-2 business days
(Save 76%)
Other sellers (Paperback)
  • All (8) from $34.58   
  • New (4) from $101.57   
  • Used (4) from $34.58   

Overview

This book constitutes the thoroughly refereed post-proceedings of the 9th International Symposium on Graph Drawing, GD 2001, held in Vienna, Austria, in September 2001.
The 32 revised full papers presented were carefully reviewed and selected from 66 paper submissions. Also included are a corrected version of a paper from the predecessor volume, short reports on the software systems exhibition, two papers of the special session on graph exchange formats, and a report on the annual graph drawing contests. The papers are organized in topical sections on hierarchical drawing, planarity, crossing theory, compaction, planar graphs, symmetries, interactive drawing, representations, aesthetics, 2D- and 3D-embeddings, data visualization, floor planning, and planar drawing.

Read More Show Less

Product Details

  • ISBN-13: 9783540433095
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 4/8/2002
  • Series: Lecture Notes in Computer Science Series , #2265
  • Edition description: 2002
  • Edition number: 1
  • Pages: 528
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.11 (d)

Table of Contents

Hierarchical Drawing.- A Fixed-Parameter Approach to Two-Layer Planarization.- How to Layer a Directed Acyclic Graph.- Fast and Simple Horizontal Coordinate Assignment.- Automated Visualization of Process Diagrams.- Planarity.- Planarization of Clustered Graphs.- An Algorithm for Finding Large Induced Planar Subgraphs.- A Characterization of DFS Cotree Critical Graphs.- Crossing Theory.- An Improved Lower Bound for Crossing Numbers.- Crossing-Critical Graphs and Path-Width.- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.- Compaction.- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.- Labeling Heuristics for Orthogonal Drawings.- Planar Graphs.- Untangling a Polygon.- Drawing with Fat Edges.- Symmetries.- Detecting Symmetries by Branch & Cut.- Drawing Graphs Symmetrically in Three Dimensions.- Interactive Drawing.- User Hints for Directed Graph Drawing.- Graph Drawing in Motion II.- Online Hierarchical Graph Drawing.- Representations.- Recognizing String Graphs Is Decidable.- On Intersection Graphs of Segments with Prescribed Slopes.- Aesthetics.- A Short Note on the History of Graph Drawing.- Towards an Aesthetic Invariant for Graph Drawing.- 2D-and 3D-Embeddings.- Orthogonal Drawings with Few Layers.- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing.- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions.- Low-Distortion Embeddings of Trees.- Data Visualization.- Insight into Data through Visualization.- Floor-Planning.- Floor-Planning via Orderly Spanning Trees.- Disconnected Graph Layout and the Polyomino Packing Approach.- Planar Drawings.- Orthogonal Drawings of Plane Graphs without Bends.- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution.- Corrected Printing of GD 2000 Paper.- On Polar Visibility Representations of Graphs.- Software Exhibition.- Tulip.- The ILOG JViews Graph Layout Module.- WAVE.- WilmaScope— An Interactive 3D Graph Visualisation System.- Exploration and Visualization of Computer Networks: Polyphemus and Hermes.- CrocoCosmos.- The Graph Drawing Server.- Drawing Database Schemas with DBdraw.- yFiles: Visualization and Automatic Layout of Graphs.- BioPath.- Graph Visualization API Library for Application Builders.- JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms.- Caesar Automatic Layout of UML Class Diagrams.- Visone Software for Visual Social Network Analysis.- Generating Schematic Cable Plans Using Springembedder Methods.- SugiBib.- Knowledge Index Manager.- Planarity Testing of Graphs on Base of a Spring Model.- AGD: A Library of Algorithms for Graph Drawing.- Industrial Plant Drawer.- Pajek— Analysis and Visualization of Large Networks.- GLIDE.- ViSta.- Graphviz— Open Source Graph Drawing Tools.- Graph Exchange Formats.- Exchanging Graphs with GXL.- GraphML Progress Report Structural Layer Proposal.- Graph Drawing Contest.- Graph-Drawing Contest Report.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)