Rectilinear Graphs and Their Embeddings

DOI10.1137/0214027MaRDI QIDQ3684138zbMATH OpenOpenAlexFDO

Authors Gopalakrishnan Vijayan, A. Wigderson

Publication date 1985

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5af7c57d8ccb3defbc12ab29f719d92bc698cf75

zbMATH Keywords

graph embeddingrectilinear graphsVLSI layout problems

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• General theoretical results on rectilinear embeddability of graphs
• Embedding rectilinear graphs in linear time
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Drawing graphs on rectangular grids
• Multilayer grid embeddings for VLSI

Cited in

(29)

• Embedding rectilinear graphs in linear time
• New results on drawing angle graphs
• Boolean approaches to graph embeddings related to VLSI
• HV-planarity: algorithms and complexity
• Embedding problems for paths with direction constrained edges.
• On a straight-line embedding problem of graphs
• On embedding a graph in the grid with the maximum number of bends and other bad features
• A note on 3D orthogonal drawings with direction constrained edges
• scientific article; zbMATH DE number 1696623 (Why is no real title available?)
• Minimum rectilinear polygons for given angle sequences
• On Rectilinear Drawing of Graphs
• Planar straight-line embedding of double-tree ccan architecture on a rectangular grid
• Connected Rectilinear Graphs on Point Sets
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• The shape of orthogonal cycles in three dimensions
• scientific article; zbMATH DE number 1839533 (Why is no real title available?)
• On Turn-Regular Orthogonal Representations
• On turn-regular orthogonal representations
• On the complexity of orthogonal compaction
• Unit-length rectangular drawings of graphs
• Unit-length rectangular drawings of graphs
• Rectilinear-upward planarity testing of digraphs
• Upward and rectilinear planarity are W[1]-hard parameterized by treewidth
• A walk on the wild side: a shape-first methodology for orthogonal drawings
• General theoretical results on rectilinear embeddability of graphs
• Minimum rectilinear polygons for given angle sequences
• Linear embeddings of simple graphs in \(\mathbb R^{3}\)
• Multilayer grid embeddings for VLSI
• Complexity results for three-dimensional orthogonal graph drawing

This page was built for publication: Rectilinear Graphs and Their Embeddings

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