On Embedding a Graph in the Grid with the Minimum Number of Bends
From MaRDI portal
Publication:3801098
Computing methodologies and applications (68U99) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cited in
(only showing first 100 items - show all)- A topology-shape-metrics framework for ortho-radial graph drawing
- Multilayer grid embeddings for VLSI
- Hardness of approximate compaction for nonplanar orthogonal graph drawings
- How to draw a planarization
- Algorithms for area-efficient orthogonal drawing
- Level-planar drawings with few slopes
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- Schnyder decompositions for regular plane graphs and application to drawing
- On minimal-node-cost planar embeddings
- Upward planar drawings with two slopes
- Drawing planar graphs using the canonical ordering
- An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
- The three-phase method: a unified approach to orthogonal graph drawing
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
- Efficient Algorithms for Ortho-Radial Graph Drawing.
- Shortest path embeddings of graphs on surfaces
- Single bend wiring on surfaces
- Planar rectilinear drawings of outerplanar graphs in linear time
- Simultaneous embeddings with few bends and crossings
- An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
- The Complexity of Angular Resolution
- Extending Partial Orthogonal Drawings
- Universal slope sets for upward planar drawings
- Advances on testing C-planarity of embedded flat clustered graphs
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- Rectilinear Graphs and Their Embeddings
- Algorithms for plane representations of acyclic digraphs
- An experimental comparison of four graph drawing algorithms.
- Edge intersection graphs of single bend paths on a grid
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Drawing orders using less ink
- Schematization of networks
- Rectilinear planarity of partial 2-trees
- Finding paths in grids with forbidden transitions
- On the complexity of anchored rectangle packing
- Bend-optimal orthogonal drawings of triconnected plane graphs
- Crossing Layout in Non-planar Graph Drawings
- Crooked diagrams with few slopes
- Representations of graphs and networks (coding, layouts and embeddings)
- Strip planarity testing for embedded planar graphs
- Finding a minimum medial axis of a discrete shape is NP-hard
- Towards area requirements for drawing hierarchically planar graphs
- Minimum rectilinear polygons for given angle sequences
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Universal slope sets for 1-bend planar drawings
- Octagonal drawings of plane graphs with prescribed face areas
- Minimum rectilinear polygons for given angle sequences
- Algorithms for Drawing Planar p-petal Graphs
- The efficient recognition on net-extensibility of graphs
- Bend-minimum orthogonal drawings in quadratic time
- Planar L-Drawings of Bimodal Graphs
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Vertex contact graphs of paths on a grid
- Graph compact orthogonal layout algorithm
- Orthogonal planarity testing of bounded treewidth graphs
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
- The shape of orthogonal cycles in three dimensions
- Proper colorability of segment intersection graphs
- Upward drawings of triconnected digraphs.
- The complexity of iterated reversible computation
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
- Rectilinear Planarity of Partial 2-Trees
- Orthogonal layout with optimal face complexity
- On turn-regular orthogonal representations
- Modifying orthogonal drawings for label placement
- PSPACE-completeness of an escape problem
- Rikudo is NP-complete
- On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- An annotated review on graph drawing and its applications
- Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
- Greedy rectilinear drawings
- Greedy rectilinear drawings
- How to draw the minimum cuts of a planar graph
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
- Planar L-drawings of directed graphs
- Planar confluent orthogonal drawings of 4-modal digraphs
- Accelerated bend minimization
- Planar L-drawings of bimodal graphs
- The complexity of Snake and undirected NCL variants
- Embedding rectilinear graphs in linear time
- Universal slope sets for upward planar drawings
- Orthogeodesic point-set embedding of trees
- HV-planarity: algorithms and complexity
- Complexity results for three-dimensional orthogonal graph drawing
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- Simultaneous orthogonal planarity
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- Bend complexity and Hamiltonian cycles in grid graphs
- Square-orthogonal drawing with few bends per edge
- Optimal orthogonal drawings of triconnected plane graphs
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- Orthogonal drawing of high degree graphs with small area and few bends
- Relating bends and size in orthogonal graph drawings
- Graph layout for applications in compiler construction
- scientific article; zbMATH DE number 1858605 (Why is no real title available?)
- New results on drawing angle graphs
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Drawing graphs on rectangular grids
- Computing orthogonal drawings with the minimum number of bends
This page was built for publication: On Embedding a Graph in the Grid with the Minimum Number of Bends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801098)
