1 option
Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings / edited by Daniel Archambault, Csaba D. Tóth.
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, 11904.
- Theoretical Computer Science and General Issues ; 11904
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Data structures (Computer science).
- Optical data processing.
- Algorithm Analysis and Problem Complexity.
- Mathematics of Computing.
- Data Structures and Information Theory.
- Computer Imaging, Vision, Pattern Recognition and Graphics.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Mathematics of Computing.
- Data Structures and Information Theory.
- Computer Imaging, Vision, Pattern Recognition and Graphics.
- Physical Description:
- 1 online resource (XXIII, 626 pages) : 460 illustrations, 244 illustrations in color.
- Edition:
- First edition 2019.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2019.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, GD 2019, held in Prague, Czech Republic, in September 2019. The 42 papers and 12 posters presented in this volume were carefully reviewed and selected from 113 submissions. They were organized into the following topical sections: Cartograms and Intersection Graphs, Geometric Graph Theory, Clustering, Quality Metrics, Arrangements, A Low Number of Crossings, Best Paper in Track 1, Morphing and Planarity, Parameterized Complexity, Collinearities, Topological Graph Theory, Best Paper in Track 2, Level Planarity, Graph Drawing Contest Report, and Poster Abstracts.
- Contents:
- Cartograms and Intersection Graphs
- Stick Graphs with Length Constraints
- Representing Graphs and Hypergraphs by Touching Polygons in 3D
- Optimal Morphs of Planar Orthogonal Drawings II
- Computing Stable Demers Cartograms
- Geometric Graph Theory
- Bundled Crossings Revisited
- Crossing Numbers of Beyond-Planar Graphs
- On the 2-Colored Crossing Number
- Minimal Representations of Order Types by Geometric Graphs
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
- Clustering
- A Quality Metric for Visualization of Clusters in Graphs
- Multi-level Graph Drawing using Infomap Clustering
- On Strict (Outer-)Confluent Graphs
- Quality Metrics
- On the Edge-Length Ratio of Planar Graphs
- Node Overlap Removal Algorithms: A Comparative Study
- Graphs with large total angular resolution
- Arrangements
- Computing Height-Optimal Tangles Faster
- On Arrangements of Orthogonal Circles
- Extending Simple Drawings
- Coloring Hasse diagrams and disjointness graphs of curves
- A Low Number of Crossings
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
- The QuaSEFE Problem
- ChordLink: A New Hybrid Visualization Model
- Stress-Plus-X (SPX) Graph Layout
- Best Paper in Track 1
- Exact Crossing Number Parameterized by Vertex Cover
- Morphing and Planarity
- Maximizing Ink in Partial Edge Drawings of k-Plane Graphs
- Graph Drawing with Morphing Partial Edges
- A Note on Universal Point Sets for Planar Graphs
- Parameterized Complexity
- Parameterized Algorithms for Book Embedding Problems
- Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs
- Collinearities
- 4-Connected Triangulations on Few Lines
- Line and Plane Cover Numbers Revisited
- Drawing planar graphs with few segments on a polynomial grid
- Variants of the Segment Number of a Graph
- Topological Graph Theory
- Local and Union Page Numbers
- Mixed Linear Layouts: Complexity, Heuristics, and Experiments
- Homotopy height, grid-major height and graph-drawing height
- On the Edge-Vertex Ratio of Maximal Thrackles
- Best Paper in Track 2
- Symmetry Detection and Classification in Drawings of Graphs
- Level Planarity
- An SPQR-Tree-Like Embedding Representation for Upward Planarity
- A Natural Quadratic Approach to the Generalized Graph Layering Problem
- Graph Stories in Small Area
- Level-Planar Drawings with Few Slopes
- Graph Drawing Contest Report
- Poster Abstracts
- A 1-planarity Testing and Embedding Algorithm
- Stretching Two Pseudolines in Planar Straight-Line Drawings
- Adventures in Abstraction: Reachability in Hierarchical Drawings
- On Topological Book Embedding for k-Plane Graphs
- On Compact RAC Drawings
- FPQ-choosable Planarity Testing
- Packing Trees into 1-Planar Graphs
- Geographic Network Visualization Techniques: A Work-In-Progress Taxonomy
- On the Simple Quasi Crossing Number of K 11
- Minimising Crossings in a Tree-Based Network
- Crossing Families and Their Generalizations
- Which Sets of Strings are Pseudospherical?.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-35802-0
- 9783030358020
- 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.