scientific article; zbMATH DE number 1500681

zbMATH Open0953.05018MaRDI QIDQ4501702FDOQ4501702

Authors: Michael Kaufmann, Roland Wiese 

Publication date: 29 January 2001

Title of this publication is not available (Why is that?)

Recommendations

• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding planar graphs at fixed vertex locations
• A new algorithm for embedding plane graphs at fixed vertex locations
• Constrained Point-Set Embeddability of Planar Graphs

zbMATH Keywords

algorithmsplane graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Cited In (9)

• Moving Vertices to Make Drawings Plane
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• A new algorithm for embedding plane graphs at fixed vertex locations
• Simultaneous Embedding of Planar Graphs with Few Bends
• On embedding a graph in the grid with the maximum number of bends and other bad features
• On Jones' subgroup of R. Thompson group \(F\)
• An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
• Embedding planar graphs at fixed vertex locations
• An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid

This page was built for publication:

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