An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
From MaRDI portal
Publication:1892581
DOI10.1007/BF01189069zbMath0826.68061OpenAlexW2258137650MaRDI QIDQ1892581
Publication date: 19 June 1995
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01189069
Related Items (4)
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems ⋮ Rectangular grid drawings of plane graphs ⋮ Rectangular grid drawings of plane graphs ⋮ Rectangular drawings of plane graphs without designated corners
Cites Work
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
- Matrix multiplication via arithmetic progressions
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- Lower bounds for planar orthogonal drawings of graphs
- Orienting planar graphs
- Rectangular duals of planar graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- A linear 5-coloring algorithm of planar graphs
- Parallel Algorithms in Graph Theory: Planarity Testing
- Optimal Search in Planar Subdivisions
- Parallel Transitive Closure and Point Location in Planar Structures
- Optimal Parallel 5-Colouring of Planar Graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- A simple parallel tree contraction algorithm
This page was built for publication: An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
