On the public citation graph

An efficient parallel algorithm for finding rectangular duals of plane triangular graphs

https://doi.org/10.1007/bf01189069
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230170306openalex-snapshot
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
inferredcites →https://doi.org/10.1007/bf01762117openalex-snapshot
A linear algorithm to find a rectangular dual of a planar triangulated graph
inferredcites →https://doi.org/10.1007/bf01840403openalex-snapshot
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1016/0012-365x(76)90065-0openalex-snapshot
Orienting planar graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90164-0openalex-snapshot
An improved parallel algorithm that computes the BFS numbering of a directed graph
inferredcites →https://doi.org/10.1016/0196-6774(81)90031-6openalex-snapshot
A linear 5-coloring algorithm of planar graphs
inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot
A simple parallel tree contraction algorithm
inferredcites →https://doi.org/10.1109/31.34669openalex-snapshot
Planar grid embedding in linear time
inferredcites →https://doi.org/10.1109/dac.1982.1585509openalex-snapshot
The Planar Package Planner for System Designers
inferredcites →https://doi.org/10.1109/dac.1982.1585567openalex-snapshot
On finding Most Optimal Rectangular Package Plans
inferredcites →https://doi.org/10.1109/sfcs.1989.63491openalex-snapshot
An optimal parallel algorithm for graph planarity
inferredcites →https://doi.org/10.1109/spdp.1991.218215openalex-snapshot
Lower bounds and parallel algorithms for planar orthogonal grid drawings
inferredcites →https://doi.org/10.1137/0211024openalex-snapshot
Parallel Algorithms in Graph Theory: Planarity Testing
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0216030openalex-snapshot
On Embedding a Graph in the Grid with the Minimum Number of Bends
inferredcites →https://doi.org/10.1137/0218020openalex-snapshot
Optimal Parallel 5-Colouring of Planar Graphs
inferredcites →https://doi.org/10.1137/0220045openalex-snapshot
Parallel Transitive Closure and Point Location in Planar Structures
inferredcites →https://doi.org/10.1137/0222072openalex-snapshot
On Finding the Rectangular Duals of Planar Triangular Graphs
inferredcites →https://doi.org/10.1145/140901.141933openalex-snapshot
O( n log log n )-work parallel algorithms for straight-line grid embeddings of planar graphs
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/28395.28429openalex-snapshot
Parallel symmetry-breaking in sparse graphs
inferredcites →https://doi.org/10.1145/41958.41980openalex-snapshot
Parallel processing for efficient subdivision search

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44968-x_9openalex-snapshot
Rectangular Drawings of Plane Graphs Without Designated Corners
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_360openalex-snapshot
Regular edge labelings and drawings of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_142openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(95)00257-xopenalex-snapshot
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00061-xopenalex-snapshot
Rectangular drawings of plane graphs without designated corners
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00003-0openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1109/iv.2005.45openalex-snapshot
Embedding Plane Graphs in the Grids
inferred← citeshttps://doi.org/10.1137/s0097539796308874openalex-snapshot
On Floor-Plan of Plane Graphs
inferred← citeshttps://doi.org/10.1145/258533.258633openalex-snapshot
On floorplans of planar graphs
inferred← citeshttps://doi.org/10.6100/ir636963openalex-snapshot
Drawing graphs for cartographic applications
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.