On the public citation graph
A random 1-011-011-01algorithm for depth first search
0 signed · 55 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.
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.
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.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1007/bf02579320openalex-snapshot
A parallel algorithm for the maximal path problem
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/0207020openalex-snapshot
Parallel Computations in Graph Theory
inferredcites →https://doi.org/10.1137/0215058openalex-snapshot
Parallel Algorithms for Depth-First Searches I. Planar Graphs
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/4221.4226openalex-snapshot
A fast parallel algorithm for the maximal independent set problem
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.3190190408openalex-snapshot
On the existence of special depth first search trees
inferred← citeshttps://doi.org/10.1002/rsa.3240020207openalex-snapshot
Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_68openalex-snapshot
On Identifying Strongly Connected Components in Parallel
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_153openalex-snapshot
An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs
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/978-3-319-13075-0_44openalex-snapshot
Depth-First Search Using $$O(n)$$ Bits
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_4openalex-snapshot
Basic Parallel Algorithms in Graph Theory
inferred← citeshttps://doi.org/10.1007/bf01192047openalex-snapshot
An optimal parallel algorithm for planar cycle separators
inferred← citeshttps://doi.org/10.1007/bf01961540openalex-snapshot
Designing checkers for programs that run in parallel
inferred← citeshttps://doi.org/10.1007/s11227-022-04457-9openalex-snapshot
Efficient parallel graph trimming by arc-consistency
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90375-4openalex-snapshot
Recognition of DFS trees: sequential and parallel algorithms with refined verifications
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90172-xopenalex-snapshot
A parallel algorithm for recognizing unordered depth-first search
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90064-1openalex-snapshot
An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90044-vopenalex-snapshot
Parallel complexity of computing a maximal set of disjoint paths
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/0022-0000(93)90042-uopenalex-snapshot
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
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.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.07.004openalex-snapshot
Frameworks for designing in-place graph algorithms
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00103-9openalex-snapshot
A remark on maximum matching of line graphs
inferred← citeshttps://doi.org/10.1109/icsmacs68968.2026.11628574openalex-snapshot
Serious Game with Haptic Feedback for Upper Limb Rehabilitation
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/wccct.2016.59openalex-snapshot
An Algorithmic Arithmetic Approach to the Water Jugs Problem
inferred← citeshttps://doi.org/10.1137/0219025openalex-snapshot
Parallel Depth-First Search in General Directed Graphs
inferred← citeshttps://doi.org/10.1137/0219047openalex-snapshot
Planar Depth-First Search in $O(\log n)$ Parallel Time
inferred← citeshttps://doi.org/10.1137/0222013openalex-snapshot
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k -Vertex Connectivity
inferred← citeshttps://doi.org/10.1137/0402037openalex-snapshot
Gaussian Elimination with Pivoting is P-Complete
inferred← citeshttps://doi.org/10.1137/0406037openalex-snapshot
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
inferred← citeshttps://doi.org/10.1137/17m114306xopenalex-snapshot
Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier
inferred← citeshttps://doi.org/10.1137/20m1313301openalex-snapshot
The Recognition Problem of Graph Search Trees
inferred← citeshttps://doi.org/10.1137/s0097539789166880openalex-snapshot
Efficient Parallel Algorithms for Chordal Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792227077openalex-snapshot
Planar Strong Connectivity Helps in Parallel Depth-First Search
inferred← citeshttps://doi.org/10.1137/s0097539794273083openalex-snapshot
An $\NC$ Algorithm for Minimum Cuts
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/1109118.1109122openalex-snapshot
Using 2-domain partitioned OBDD data structure in an enhanced symbolic simulator
inferred← citeshttps://doi.org/10.1145/3087556.3087576openalex-snapshot
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3364212openalex-snapshot
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
inferred← citeshttps://doi.org/10.1145/564870.564917openalex-snapshot
Heuristics for semi-external depth first search on directed graphs
inferred← citeshttps://doi.org/10.21822/2073-6185-2024-51-1-113-122openalex-snapshot
Applying Genetic Algorithm for test pattern generation process optimization
inferred← citeshttps://doi.org/10.5120/ijca2015905826openalex-snapshot
A Cognitive Approach to solve Water Jugs Problem
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.