An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid

DOI10.1016/S0166-218X(03)00373-1zbMath1043.05108OpenAlexW2032822378MaRDI QIDQ1827866

Giovanna Sontacchi, Aurora Morgana, Célia Picinin de Mello

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00373-1

zbMATH Keywords

VLSI designGridGraph algorithmBendPlanar embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Orthogonal graph drawing with flexibility constraints ⋮ Grid straight-line embeddings of trees with a minimum number of bends per path

Cites Work

• Unnamed Item
• General theoretical results on rectilinear embeddability of graphs
• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid