On minimal-node-cost planar embeddings

DOI10.1002/NET.3230140202MaRDI QIDQ3338119zbMATH OpenOpenAlexFDO

Authors James A. Storer

Publication date 1984

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230140202

zbMATH Keywords

minimal-node-cost planar embeddingsnode cost measureundirected graphVLSI layout

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• scientific article; zbMATH DE number 219263
• scientific article; zbMATH DE number 432759
• Drawing graphs on rectangular grids

Cites work

• scientific article; zbMATH DE number 3639124 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Tape bounds for time-bounded Turing machines

Cited in

(30)

• Octagonal drawings of plane graphs with prescribed face areas
• A unified approach to visibility representations of planar graphs
• Algorithms for plane representations of acyclic digraphs
• Representations of graphs and networks (coding, layouts and embeddings)
• Lower bounds for planar orthogonal drawings of graphs
• Area requirement and symmetry display of planar upward drawings
• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
• New results on drawing angle graphs
• Algorithms for area-efficient orthogonal drawing
• A better heuristic for orthogonal graph drawings
• Rectangular grid drawings of plane graphs
• Three-dimensional orthogonal graph drawing algorithms
• Untangling planar curves
• Drawing graphs on rectangular grids
• Drawing planar graphs using the canonical ordering
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• Overloaded orthogonal drawings
• How to draw a hypergraph
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Bend-optimal orthogonal graph drawing in the general position model
• scientific article; zbMATH DE number 51713 (Why is no real title available?)
• scientific article; zbMATH DE number 219263 (Why is no real title available?)
• A polynomial upper bound on Reidemeister moves
• Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
• Orthogonal drawing of high degree graphs with small area and few bends
• Algorithm Theory - SWAT 2004
• The DFS-heuristic for orthogonal graph drawing

This page was built for publication: On minimal-node-cost planar embeddings

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