Embedding rectilinear graphs in linear time

DOI10.1016/0020-0190(88)90032-4zbMath0658.68086OpenAlexW2166449951MaRDI QIDQ1111399

Klaus Kriegel, Frank Hoffmann

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90032-4

zbMATH Keywords

graph embeddinglinear-time algorithmrectilinear graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

HV-planarity: algorithms and complexity ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ On the complexity of orthogonal compaction ⋮ Connected Rectilinear Graphs on Point Sets

Cites Work

• Rectilinear Graphs and Their Embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Automata and Labyrinths
• The embeddings of a graph—A survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding rectilinear graphs in linear time