On the public citation graph

All graphs have cycle separators and planar directed depth-first search is in DNC

https://doi.org/10.1007/bfb0040373
0 signed · 38 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/bf01937481openalex-snapshot
A parallel search algorithm for directed acyclic graphs
inferredcites →https://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferredcites →https://doi.org/10.1016/0020-0190(88)90172-xopenalex-snapshot
A parallel algorithm for recognizing unordered depth-first search
inferredcites →https://doi.org/10.1016/0022-0000(88)90006-2openalex-snapshot
An efficient parallel algorithm for planarity
inferredcites →https://doi.org/10.1016/0022-0000(89)90013-5openalex-snapshot
Fast and efficient solution of path algebra problems
inferredcites →https://doi.org/10.1109/sfcs.1980.13openalex-snapshot
Area-efficient graph layouts
inferredcites →https://doi.org/10.1109/sfcs.1983.44openalex-snapshot
Partition of planar flow networks
inferredcites →https://doi.org/10.1109/sfcs.1985.16openalex-snapshot
Computing ears and branchings in parallel
inferredcites →https://doi.org/10.1109/sfcs.1986.49openalex-snapshot
Separator-based strategies for efficient message routing
inferredcites →https://doi.org/10.1109/sfcs.1986.6openalex-snapshot
An efficient parallel algorithm for planarity
inferredcites →https://doi.org/10.1109/sfcs.1987.3openalex-snapshot
A parallel algorithm for finding a separator in planar graphs
inferredcites →https://doi.org/10.1109/tc.1981.6312176openalex-snapshot
Universality considerations in VLSI circuits
inferredcites →https://doi.org/10.1109/tc.1985.6312202openalex-snapshot
The power of parallel prefix
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0215058openalex-snapshot
Parallel Algorithms for Depth-First Searches I. Planar Graphs
inferredcites →https://doi.org/10.1137/0716027openalex-snapshot
Generalized Nested Dissection
inferredcites →https://doi.org/10.1145/28395.28429openalex-snapshot
Parallel symmetry-breaking in sparse graphs
inferredcites →https://doi.org/10.1145/28395.28430openalex-snapshot
A random NC algorithm for depth first search
inferredcites →https://doi.org/10.1145/73007.73035openalex-snapshot
Parallel depth-first search in general directed graphs
inferredcites →https://doi.org/10.1145/800057.808703openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22045openalex-snapshot
Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_54openalex-snapshot
Linear time algorithms for k-cutwidth problem
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_266openalex-snapshot
Improved parallel depth-first search in undirected planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_25openalex-snapshot
Efficient parallel algorithms for planar st-graphs
inferred← citeshttps://doi.org/10.1007/bf01192047openalex-snapshot
An optimal parallel algorithm for planar cycle separators
inferred← citeshttps://doi.org/10.1007/s00453-002-0995-0openalex-snapshot
Efficient Parallel Algorithms for Planar st-Graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90189-3openalex-snapshot
Not all planar diagraphs have small cycle separators
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90033-copenalex-snapshot
A model classifying algorithms as inherently sequential with applications to graph searching
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1109/spdp.1990.143654openalex-snapshot
The parallel complexity of queue versus stack breadth-first search
inferred← citeshttps://doi.org/10.1109/spdp.1991.218217openalex-snapshot
New divide-and-conquer techniques for finding disjoint paths
inferred← citeshttps://doi.org/10.1137/0219025openalex-snapshot
Parallel Depth-First Search in General Directed Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792227077openalex-snapshot
Planar Strong Connectivity Helps in Parallel Depth-First Search
inferred← citeshttps://doi.org/10.1145/100216.100237openalex-snapshot
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs
inferred← citeshttps://doi.org/10.1145/3774934.3786457openalex-snapshot
DiggerBees: Depth First Search Leveraging Hierarchical Block-Level Stealing on GPUs
inferred← citeshttps://doi.org/10.1145/73007.73034openalex-snapshot
Local reorientation, global order, and planar topology
inferred← citeshttps://doi.org/10.1145/73007.73035openalex-snapshot
Parallel depth-first search in general directed 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.