Constrained Simultaneous and Near-Simultaneous Embeddings

DOI10.1007/978-3-540-77537-9_27zbMATH Open1137.68488OpenAlexW2062394719MaRDI QIDQ5452230FDOQ5452230

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

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

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)

Cites Work

• Title not available (Why is that?)
• Drawing graphs. Methods and models
• On simultaneous planar graph embeddings
• Level Planar Embedding in Linear Time
• Embedding Graphs Simultaneously with Fixed Edges
• A characterization of level planar graphs
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Graph Drawing
• Graph Drawing

Cited In (8)

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

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)