Simultaneous Geometric Graph Embeddings
DOI10.1007/978-3-540-77537-9_28zbMATH Open1137.68481OpenAlexW1483285511MaRDI QIDQ5452231FDOQ5452231
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
Recommendations
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)
Cited In (29)
- Simultaneous graph embedding with bends and circular arcs
- Simultaneous Graph Embeddings with Fixed Edges
- Simultaneous visibility representations of undirected pairs of graphs
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- The complexity of simultaneous geometric graph embedding
- Matched drawability of graph pairs and of graph triples
- 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
- Title not available (Why is that?)
- 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
- Drawing Simultaneously Embedded Graphs with Few Bends
- Characterizing simultaneous embedding with fixed edges
- Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete
- The QuaSEFE problem
- Geometric RAC Simultaneous Drawings of Graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Graph Simultaneous Embedding Tool, GraphSET
- Partial and simultaneous transitive orientations via modular decompositions
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)
