An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm to find a rectangular dual of a planar triangulated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear 5-coloring algorithm of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parallel 5-Colouring of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Rectangular Duals of Planar Triangular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms in Graph Theory: Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular duals of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for planar orthogonal drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Transitive Closure and Point Location in Planar Structures / rank
 
Normal rank

Latest revision as of 14:57, 23 May 2024

scientific article
Language Label Description Also known as
English
An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
scientific article

    Statements

    An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 June 1995
    0 references
    0 references
    parallel algorithm
    0 references
    plane triangular graphs
    0 references