Enumerating grid layouts of graphs

DOI10.7155/JGAA.00541MaRDI QIDQ5119387zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 4 September 2020

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00541

zbMATH Keywords

layouts of graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 177431
• A New Graph-Theoretic Heuristic for Facility Layout
• Efficient facility layout planning in a maximally planar graph model
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• The Vertex Splitting Algorithm for facilities layout

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Certifying and constructing minimally rigid graphs in the plane
• Complexity dichotomy on partial grid recognition
• Detecting and counting small patterns in planar graphs in subexponential parameterized time
• Distances in a rigid unit-distance graph in the plane
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• New upper bounds on the decomposability of planar graphs
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• Operations preserving the global rigidity of graphs and frameworks in the plane
• Rectilinear shortest paths in the presence of rectangular barriers
• Rigid realizations of graphs on small grids
• Subexponential time algorithms for embedding H-minor free graphs
• Sufficient conditions for the global rigidity of graphs
• Who needs crossings? Hardness of plane graph rigidity

Cited in

(3)

• scientific article; zbMATH DE number 5606398 (Why is no real title available?)
• Layouts of Expander Graphs
• Drawn tree decomposition: new approach for graph drawing problems

This page was built for publication: Enumerating grid layouts of graphs

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