Constrained Simultaneous and Near-Simultaneous Embeddings

DOI10.1007/978-3-540-77537-9_27zbMath1137.68488OpenAlexW2062394719MaRDI QIDQ5452230

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

Graph theory (including graph drawing) in computer science (68R10) 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)

Related Items (4)

Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Colored simultaneous geometric embeddings and universal pointsets ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ Embeddability Problems for Upward Planar Digraphs

Cites Work

• Unnamed Item
• On simultaneous planar graph embeddings
• A characterization of level planar graphs
• Embedding Graphs Simultaneously with Fixed Edges
• Level Planar Embedding in Linear Time
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Graph Drawing
• Graph Drawing
• Drawing graphs. Methods and models

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