Simultaneous Geometric Graph Embeddings

DOI10.1007/978-3-540-77537-9_28zbMath1137.68481MaRDI QIDQ5452231

No author found.

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_28

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges, The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs, Characterization of unlabeled level planar trees, Simultaneous graph embedding with bends and circular arcs, An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges, Graph Simultaneous Embedding Tool, GraphSET