Vai al contenuto principale della pagina

Graph Drawing [[electronic resource] ] : 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers / / edited by David Eppstein, Emden R Gansner



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Graph Drawing [[electronic resource] ] : 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers / / edited by David Eppstein, Emden R Gansner Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Edizione: 1st ed. 2010.
Descrizione fisica: 1 online resource (426 p. 199 illus.)
Disciplina: 004.0151
Soggetto topico: Computer science—Mathematics
Discrete mathematics
Algorithms
Computer science
User interfaces (Computer systems)
Human-computer interaction
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
Models of Computation
Symbolic and Algebraic Manipulation
User Interfaces and Human Computer Interaction
Persona (resp. second.): EppsteinDavid
GansnerEmden R
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di contenuto: 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.
Titolo autorizzato: Graph Drawing  Visualizza cluster
ISBN: 1-280-38569-3
9786613563613
3-642-11805-4
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996465291703316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 5849