Graph Drawing: 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers / Edition 1

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $25.00
Usually ships in 1-2 business days
(Save 83%)
Other sellers (Paperback)
  • All (5) from $25.00   
  • New (2) from $110.23   
  • Used (3) from $25.00   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$110.23
Seller since 2011

Feedback rating:

(904)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
Brand new and unread! Join our growing list of satisfied customers!

Ships from: Phoenix, MD

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$110.24
Seller since 2007

Feedback rating:

(23484)

Condition: New
BRAND NEW

Ships from: Avenel, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

This book constitutes the thoroughly refereed post-proceedings of the 11th International Symposium on Graph Drawing, GD 2003, held in Perugia, Italy, in September 2003.

The 34 revised full papers and 11 revised short papers presented were carefully selected during two rounds of reviewing and improvement. Also included are 6 posters, a report on the 2003 graph drawing contest, 2 invited contributions, as well as a comprehensive survey article presenting 42 challenging open problems in the area. The papers are organized in topical sections on planarity and planar drawings; geometric graph theory; application and systems; straight-line, circular, and circular-arc drawings; symmetrics; 3D-drawings; embeddings and triangulations; fixed parameter tractability; clusters, cuts, and orthogonal drawings; k-level drawings; force-directed and energy-based techniques; and surfaces and diagrams.

Read More Show Less

Product Details

  • ISBN-13: 9783540208310
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 3/5/2004
  • Series: Lecture Notes in Computer Science Series , #2912
  • Edition description: 2004
  • Edition number: 1
  • Pages: 542
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.15 (d)

Table of Contents

Planarity and Planar Drawings.- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.- An Experimental Study of Crossing Minimization Heuristics.- Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.- Bounds and Methods for k-Planar Crossing Numbers.- Geometric Graph Theory.- How Many Ways Can One Draw a Graph?.- Two Results on Intersection Graphs of Polygons.- Stretching of Jordan Arc Contact Systems.- Noncrossing Hamiltonian Paths in Geometric Graphs.- Applications and Systems – Part I.- GraphAEL: Graph Animations with Evolving Layouts.- Visualizing Related Metabolic Pathways in Two and a Half Dimensions.- GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon – System Demonstration.- Straight-Line, Circular, and Circular-Arc Drawings.- Area-Efficient Drawings of Outerplanar Graphs.- A Framework for User-Grouped Circular Drawings.- Fixed-Location Circular-Arc Drawing of Planar Graphs.- A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio.- Symmetries.- An Integer Programming Approach to Fuzzy Symmetry Detection.- Barycentric Drawings of Periodic Graphs.- 3D-Drawings.- Three-Dimensional Grid Drawings with Sub-quadratic Volume.- Laying Out Iterated Line Digraphs Using Queues.- Track Drawings of Graphs with Constant Queue Number.- 3D Visibility Representations of Complete Graphs.- Drawing Series-Parallel Graphs on Restricted Integer 3D Grids.- Nearly Optimal Three Dimensional Layout of Hypercube Networks.- Embeddings and Triangulations.- Graph Embedding with Minimum Depth and Maximum External Face.- More Efficient Generation of Plane Triangulations.- Planar Embeddings of Graphs with Specified Edge Lengths.- Applications and Systems – Part II.- BGPlay: A System for Visualizing the Interdomain Routing Evolution.- GraphEx: An Improved Graph Translation Service.- A Constrained, Force-Directed Layout Algorithm for Biological Pathways.- Intersection-Free Morphing of Planar Graphs.- Fixed Parameter Tractability.- Fixed Parameter Algorithms for one-sided crossing minimization Revisited.- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization.- Clusters, Cuts, and Orthogonal Drawings.- Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles.- Convex Drawing for c-Planar Biconnected Clustered Graphs.- Layout of Directed Hypergraphs with Orthogonal Hyperedges.- No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs.- k-Level Drawings.- Radial Level Planarity Testing and Embedding in Linear Time.- An Improved Approximation to the One-Sided Bilayer Drawing.- Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves.- Force Directed and Energy-Based Techniques.- An Energy Model for Visual Graph Clustering.- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes.- Axis-by-Axis Stress Minimization.- Drawing Graphs with Nonuniform Nodes Using Potential Fields.- Surfaces and Diagrams.- Drawing Area-Proportional Venn and Euler Diagrams.- Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface.- Posters.- Degree Navigator TM : The Journey of a Visualization Software.- HexGraph: Applying Graph Drawing Algorithms to the Game of Hex.- GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions.- Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework.- The Puzzle Layout Problem.- Visual Data Mining with ILOG Discovery.- Graph Drawing Contest.- Graph Drawing Contest Report.- Invited Talks.- Engineering and Visualizing Algorithms.- Report on the Invited Lecture by Pat Hanrahan, Titled “On Being in the Right Space”.- Open Problems.- Selected Open Problems in Graph Drawing.

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)