On the public citation graph

A linear time algorithm to recognize clustered planar graphs and its parallelization

https://doi.org/10.1007/bfb0054325
0 signed · 72 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.1007/3-540-60313-1_145openalex-snapshot
Planarity for clustered graphs
inferredcites →https://doi.org/10.1007/3-540-62495-3_42openalex-snapshot
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
inferredcites →https://doi.org/10.1007/bf02022041openalex-snapshot
Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions
inferredcites →https://doi.org/10.1007/bfb0049394openalex-snapshot
A better heuristic for orthogonal graph drawings
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot
A simple parallel tree contraction algorithm
inferredcites →https://doi.org/10.1016/0304-3975(86)90153-2openalex-snapshot
Parallel ear decomposition search (EDS) and st-numbering in graphs
inferredcites →https://doi.org/10.1016/0377-2217(90)90106-lopenalex-snapshot
Efficient parallel algorithms
inferredcites →https://doi.org/10.1016/0377-2217(90)90254-9openalex-snapshot
Efficient parallel algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(05)80070-4openalex-snapshot
Planarity testing in parallel
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot
Planar Graphs: Theory and Algorithms
inferredcites →https://doi.org/10.1044/1059-0889(1998/019)openalex-snapshot
State of the States
inferredcites →https://doi.org/10.1109/sfcs.1992.267814openalex-snapshot
Drawing planar graphs using the lmc-ordering
inferredcites →https://doi.org/10.1109/visual.1992.235207openalex-snapshot
The state of the art of visual languages for visualization
inferredcites →https://doi.org/10.1112/blms/21.5.497openalex-snapshot
PLANAR GRAPHS: THEORY AND ALGORITHMS (Annals of Discrete Mathematics 32)
inferredcites →https://doi.org/10.1112/plms/s3-13.1.743openalex-snapshot
How to Draw a Graph
inferredcites →https://doi.org/10.1142/0922openalex-snapshot
Visualizing Abstract Objects and Relations
inferredcites →https://doi.org/10.1145/42411.42414openalex-snapshot
On visual formalisms
inferredcites →https://doi.org/10.1145/65950.65952openalex-snapshot
Hierarchical planarity testing algorithms
inferredcites →https://doi.org/10.5555/949685.949723openalex-snapshot
The state of the art of visual languages for visualization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11618058_20openalex-snapshot
C-Planarity of Extrovert Clustered Graphs
inferred← citeshttps://doi.org/10.1007/11618058_5openalex-snapshot
On Embedding a Cycle in a Plane Graph
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_21openalex-snapshot
Advances in C-Planarity Testing of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_8openalex-snapshot
A Linear Time Implementation of SPQR-Trees
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_4openalex-snapshot
The SPQR-Tree Data Structure in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_655openalex-snapshot
Clustered Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_10openalex-snapshot
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_2openalex-snapshot
Clustered Planarity = Flat Clustered Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-96193-4_2openalex-snapshot
Graph Visualization
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_34openalex-snapshot
Convex Drawing for c-Planar Biconnected Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_18openalex-snapshot
Clustered Level Planarity
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_12openalex-snapshot
Clustering Cycles into Cycles of Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_15openalex-snapshot
Completely Connected Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_23openalex-snapshot
Subgraph Induced Planar Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_29openalex-snapshot
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_30openalex-snapshot
Clustered Planarity: Small Clusters in Eulerian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_11openalex-snapshot
Clustered Planarity: Clusters with Few Outgoing Edges
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_12openalex-snapshot
Computing Maximum C-Planar Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_13openalex-snapshot
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_3openalex-snapshot
Straight-Line Rectangular Drawings of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_8openalex-snapshot
Splitting Clusters to Get C-Planarity
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_2openalex-snapshot
Technical Foundations
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_655-1openalex-snapshot
Clustered Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_27openalex-snapshot
Multilevel Drawings of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_9openalex-snapshot
Shrinking the Search Space for Clustered Planarity
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_35openalex-snapshot
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_37openalex-snapshot
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_12openalex-snapshot
Beyond Clustered Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00839-2openalex-snapshot
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
inferred← citeshttps://doi.org/10.1007/s00454-010-9302-zopenalex-snapshot
Straight-Line Rectangular Drawings of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/s00454-020-00177-0openalex-snapshot
Treetopes and Their Graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.008openalex-snapshot
How to draw the minimum cuts of a planar graph
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.001openalex-snapshot
Relaxing the constraints of clustered planarity
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.044openalex-snapshot
Drawing c-planar biconnected clustered graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.002openalex-snapshot
Completely connected clustered graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxw035openalex-snapshot
SEFE = C-Planarity?
inferred← citeshttps://doi.org/10.1109/apvis.2007.329278openalex-snapshot
Overlapping cluster planarity
inferred← citeshttps://doi.org/10.1137/1.9781611973198.9openalex-snapshot
Practical Experience with Hanani-Tutte for Testing c-Planarity
inferred← citeshttps://doi.org/10.1145/1064092.1064093openalex-snapshot
Clustered planarity
inferred← citeshttps://doi.org/10.1201/b15385-4openalex-snapshot
- Planarity Testing and Embedding
inferred← citeshttps://doi.org/10.1201/b16132-53openalex-snapshot
Graphs and Finite Geometries
inferred← citeshttps://doi.org/10.1201/b16132-73openalex-snapshot
Drawings of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1207.3934openalex-snapshot
Relaxing the Constraints of Clustered Planarity
inferred← citeshttps://doi.org/10.48550/arxiv.1410.1006openalex-snapshot
A Survey on Small-Area Planar Graph Drawing
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04606openalex-snapshot
C-Planarity of Overlapping Clusterings Including Unions of Two Partitions
inferred← citeshttps://doi.org/10.7155/jgaa.00165openalex-snapshot
C-Planarity of C-Connected Clustered Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00167openalex-snapshot
Overlapping Cluster Planarity
inferred← citeshttps://doi.org/10.7155/jgaa.00191openalex-snapshot
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
inferred← citeshttps://doi.org/10.7155/jgaa.00192openalex-snapshot
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
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.