Simultaneous Geometric Graph Embeddings

DOI10.1007/978-3-540-77537-9_28MaRDI QIDQ5452231zbMATH OpenOpenAlexFDO

Authors

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

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• The complexity of simultaneous geometric graph embedding
• Simultaneous embedding of embedded planar graphs
• Simultaneous embedding of embedded planar graphs
• Simultaneous Graph Embeddings with Fixed Edges
• On simultaneous planar graph embeddings

Cited in

(29)

• Graph Simultaneous Embedding Tool, GraphSET
• Simultaneous graph embedding with bends and circular arcs
• Partial and simultaneous transitive orientations via modular decompositions
• Simultaneous visibility representations of undirected pairs of graphs
• Simultaneous Graph Embeddings with Fixed Edges
• An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
• Matched drawability of graph pairs and of graph triples
• The complexity of simultaneous geometric graph embedding
• Simultaneous orthogonal planarity
• Simultaneous representation of proper and unit interval graphs
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Simultaneous embedding of embedded planar graphs
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
• On simultaneous planar graph embeddings
• scientific article; zbMATH DE number 7370580 (Why is no real title available?)
• Characterization of unlabeled level planar trees
• On the complexity of some geometric problems with fixed parameters
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
• Simultaneous embeddings with few bends and crossings
• Non-crossing geometric Steiner arborescences
• On the \(\mathcal{NP}\)-hardness of \textsc{GRacSim drawing} and \(k\)-SEFE problems
• Simultaneous Embedding
• The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
• Characterizing simultaneous embedding with fixed edges
• Drawing Simultaneously Embedded Graphs with Few Bends
• The QuaSEFE problem
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Geometric RAC Simultaneous Drawings of Graphs
• Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete

This page was built for publication: Simultaneous Geometric Graph Embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452231)