Unit-length rectangular drawings of graphs
From MaRDI portal
Publication:6636988
DOI10.7155/JGAA.V28I1.2996MaRDI QIDQ6636988
Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Giordano Da Lozzo, Maurizio Patrignani, Carlos Alegría
Publication date: 12 November 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of minimizing wire lengths in VLSI layouts
- Unit-length embedding of binary trees on a square grid
- Checking the convexity of polytopes and the planarity of subdivisions
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- A better heuristic for orthogonal graph drawings
- Rectangular grid drawings of plane graphs
- Fixed edge-length graph drawing is NP-hard
- Incremental convex planarity testing
- On-line maintenance of triconnected components with SPQR-trees
- Drawing planar graphs using the canonical ordering
- Planar rectilinear drawings of outerplanar graphs in linear time
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
- On the computational complexity of upward and rectilinear planarity testing
- Realizability of Graphs and Linkages
- Rectangle and Square Representations of Planar Graphs
- Anchored Drawings of Planar Graphs
- Simultaneous Orthogonal Planarity
- Who Needs Crossings? Hardness of Plane Graph Rigidity
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Rectilinear Graphs and Their Embeddings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Orthogonal Drawings of Plane Graphs Without Bends
- On-Line Planarity Testing
- Hamilton Paths in Grid Graphs
- Rectangular drawings of planar graphs
- On Turn-Regular Orthogonal Representations
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- On Turn-Regular Orthogonal Representations
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Puzzling Grid Embeddings
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Planar Embeddings of Graphs with Specified Edge Lengths
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- Optimal Morphs of Convex Drawings
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
- Depth-First Search and Linear Graph Algorithms
- On Diagrams Representing Maps
- Accelerated Bend Minimization
- Graph Drawing
- Unit-length rectangular drawings of graphs
- Grid recognition: classical and parameterized computational perspectives
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
This page was built for publication: Unit-length rectangular drawings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636988)
