1 option
Graph Drawing : 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers / edited by David Eppstein, Emden R Gansner.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 5849.
- Theoretical Computer Science and General Issues ; 5849
- Language:
- English
- Subjects (All):
- Computer science--Mathematics.
- Computer science.
- Algorithms.
- Computers.
- User interfaces (Computer systems).
- Discrete Mathematics in Computer Science.
- Math Applications in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Models and Principles.
- Symbolic and Algebraic Manipulation.
- User Interfaces and Human Computer Interaction.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Math Applications in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Models and Principles.
- Symbolic and Algebraic Manipulation.
- User Interfaces and Human Computer Interaction.
- Physical Description:
- 1 online resource (426 pages) : 199 illustrations.
- Edition:
- First edition 2010.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
- System Details:
- text file PDF
- Contents:
- Invited Talks
- Why Are String Graphs So Beautiful?
- The Art of Cheating When Drawing a Graph
- Papers
- Drawing Hamiltonian Cycles with No Large Angles
- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
- On the Perspectives Opened by Right Angle Crossing Drawings
- Drawing 3-Polytopes with Good Vertex Resolution
- Planar Drawings of Higher-Genus Graphs
- Splitting Clusters to Get C-Planarity
- On the Characterization of Level Planar Trees by Minimal Patterns
- Characterization of Unlabeled Radial Level Planar Graphs
- Upward Planarization Layout
- More Flexible Radial Layout
- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations
- Port Constraints in Hierarchical Layout of Data Flow Diagrams
- Fast Edge-Routing for Large Graphs
- Leftist Canonical Ordering
- Succinct Greedy Drawings Do Not Always Exist
- Geometric Simultaneous Embeddings of a Graph and a Matching
- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
- Removing Independently Even Crossings
- Manhattan-Geodesic Embedding of Planar Graphs
- Orthogonal Connector Routing
- On Rectilinear Drawing of Graphs
- Semi-bipartite Graph Visualization for Gene Ontology Networks
- On Open Problems in Biological Network Visualization
- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View
- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
- Drawing Trees in a Streaming Model
- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
- Drawing Planar 3-Trees with Given Face-Areas
- 3D Visibility Representations by Regular Polygons
- Complexity of Some Geometric and Topological Problems
- On Planar Supports for Hypergraphs
- DAGmaps and ?-Visibility Representations of DAGs
- Drawing Directed Graphs Clockwise
- An Improved Algorithm for the Metro-line Crossing Minimization Problem
- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection
- Posters
- GMap: Drawing Graphs as Maps
- Using High Dimensions to Compare Drawings of Graphs
- On ?-Constrained Upward Topological Book Embeddings
- 4-Labelings and Grid Embeddings of Plane Quadrangulations
- IBM ILOG Graph Layout for Eclipse
- Layout Techniques Coupled with Web2.0-Based Business Process Modeling
- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles
- Visualization of Complex BPEL Models
- DAGmaps and Dominance Relationships
- Scaffold Hunter - Interactive Exploration of Chemical Space
- Graph Drawing Contest
- Graph Drawing Contest Report.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-11805-0
- 9783642118050
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.