Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers (Lecture Notes in Computer Science, 5849). Questo articolo non è disponibile.
Lingua: inglese
Editore: Springer, 2010
- Brossura
- Nuovo

Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Venditore con 5 stelle
Venditore AbeBooks dal 25 marzo 2015
Non disponibile
Brossura
Condizione: Nuovo
EUR 117,80
Descrizione dell’articolo da parte del venditore
In English.
Codice articolo ria9783642118043_new
- Titolo
- Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers (Lecture Notes in Computer Science, 5849)
- Editore
- Springer
- Anno di pubblicazione
- 2010
- Condizione
- New
- Rilegatura
- Brossura
- Lingua
- inglese
- ISBN 10
- 3642118046
- ISBN 13
- 9783642118043
- Peso dell'articolo
- 747 grammi
McClelland,MichaelJ.PelsmajerandMarcusSchaefer.
"Riassunto" può appartenere a un’altra edizione di questo titolo.
Contenuti
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.
"Descrizione articolo" può appartenere a un’altra edizione di questo titolo.
Risultati della ricerca per Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers (Lecture Notes in Computer Science, 5849)
Ci sono altre 4 copie di questo libroVisualizza tutti i risultati