Constrained Simultaneous and Near-Simultaneous Embeddings

DOI10.1007/978-3-540-77537-9_27MaRDI QIDQ5452230zbMATH OpenOpenAlexFDO

Authors Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov

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_27

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Constrained simultaneous and near-simultaneous embeddings
• On simultaneous planar graph embeddings
• Planar and Quasi Planar Simultaneous Geometric Embedding
• Geometric simultaneous embeddings of a graph and a matching
• Algorithms and Data Structures

Cites work

• A characterization of level planar graphs
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Drawing graphs. Methods and models
• Embedding Graphs Simultaneously with Fixed Edges
• Graph Drawing
• Graph Drawing
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• Level Planar Embedding in Linear Time
• On simultaneous planar graph embeddings

Cited in

(8)

• Constrained simultaneous and near-simultaneous embeddings
• Matched Drawability of Graph Pairs and of Graph Triples
• Embeddability Problems for Upward Planar Digraphs
• Simultaneous Embedding
• Critical imbeddings with multivariate rearrangements
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Colored simultaneous geometric embeddings and universal pointsets
• Geometric simultaneous embeddings of a graph and a matching

This page was built for publication: Constrained Simultaneous and Near-Simultaneous Embeddings

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