scientific article; zbMATH DE number 1500681

MaRDI QIDQ4501702zbMATH OpenFDO

Authors Michael Kaufmann, Roland Wiese

Publication date 29 January 2001

zbMATH Keywords

algorithmsplane graphs

Mathematics Subject Classification ID

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

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

Cited in

(12)

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

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)