An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
type: Item
instance of: scholarly article
title: An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
zbMATH Open document ID: 0826.68061
DOI: 10.1007/BF01189069
author: Xin He
published in: Algorithmica
publication date: 1995-06-19T00:00:00Z
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 765171
zbMATH Keywords: parallel algorithm
zbMATH Keywords: plane triangular graphs
MaRDI profile type: Publication
cites work: A simple parallel tree contraction algorithm
cites work: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
cites work: A linear algorithm to find a rectangular dual of a planar triangulated graph
cites work: A linear 5-coloring algorithm of planar graphs
cites work: Matrix multiplication via arithmetic progressions
cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph
cites work: Optimal Parallel 5-Colouring of Planar Graphs
cites work: On Finding the Rectangular Duals of Planar Triangular Graphs
cites work: Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
cites work: Parallel Algorithms in Graph Theory: Planarity Testing
cites work: Orienting planar graphs
cites work: Optimal Search in Planar Subdivisions
cites work: Rectangular duals of planar graphs
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
cites work: A unified approach to visibility representations of planar graphs
cites work: Lower bounds for planar orthogonal drawings of graphs
cites work: Parallel Transitive Closure and Point Location in Planar Structures
full work available at URL: https://doi.org/10.1007/bf01189069
OpenAlex ID: W2258137650
description: scientific article; zbMATH DE number 765171