On the public citation graph
Efficient parallel triconnectivity in logarithmic time
0 signed · 43 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.1016/0022-0000(84)90003-5openalex-snapshot
Finding Euler tours in parallel
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(84)90018-xopenalex-snapshot
Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
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/b978-0-12-417750-5.50011-7openalex-snapshot
QUEUES, STACKS AND GRAPHS
inferredcites →https://doi.org/10.1090/s0002-9904-1976-13986-9openalex-snapshot
A forbidden substructure characterization of Gauss codes
inferredcites →https://doi.org/10.1090/s0002-9947-1932-1501641-2openalex-snapshot
Non-separable and planar graphs
inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot
Approximate and exact parallel scheduling with applications to list, tree and graph problems
inferredcites →https://doi.org/10.1145/28395.28431openalex-snapshot
A new graphy triconnectivity algorithm and its parallelization
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.48550/arxiv.2406.06321openalex-snapshot
Optimal Preprocessing for Answering On-Line Product Queries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230230604openalex-snapshot
Finding all minimum‐size separating vertex sets in a graph
inferred← citeshttps://doi.org/10.1006/jagm.1997.0905openalex-snapshot
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_5openalex-snapshot
A framework for parallel graph algorithm design
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_66openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_246openalex-snapshot
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_42openalex-snapshot
Efficient parallel graph algorithms based on open ear decomposition
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/bf01191205openalex-snapshot
A new graph triconnectivity algorithm and its parallelization
inferred← citeshttps://doi.org/10.1007/bf01200429openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/bfb0035768openalex-snapshot
Parallel algorithmic techniques for combinatorial computation
inferred← citeshttps://doi.org/10.1007/bfb0035771openalex-snapshot
Finding triconnected components by local replacements
inferred← citeshttps://doi.org/10.1007/bfb0097993openalex-snapshot
A range minima parallel algorithm for coarse grained multicomputers
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90004-oopenalex-snapshot
Improved algorithms for graph four- connectivity
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90071-ropenalex-snapshot
Efficient parallel graph algorithms based on open ear decomposition
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.2026.103756openalex-snapshot
Quantum data structure for range minimum query
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80070-4openalex-snapshot
Planarity testing in parallel
inferred← citeshttps://doi.org/10.1109/71.841748openalex-snapshot
An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing
inferred← citeshttps://doi.org/10.1109/hipc.2018.00017openalex-snapshot
Expediting Parallel Graph Connectivity Algorithms
inferred← citeshttps://doi.org/10.1109/icci.1993.315382openalex-snapshot
A distributed algorithm for ear decomposition
inferred← citeshttps://doi.org/10.1109/sfcs.1987.33openalex-snapshot
Improved algorithms for graph four-connectivity
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63491openalex-snapshot
An optimal parallel algorithm for graph planarity
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185451openalex-snapshot
On-line maintenance of the four-connected components of a graph
inferred← citeshttps://doi.org/10.1109/spdp.1993.395494openalex-snapshot
An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing
inferred← citeshttps://doi.org/10.1137/0222040openalex-snapshot
Finding Triconnected Components by Local Replacement
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/28395.28431openalex-snapshot
A new graphy triconnectivity algorithm and its parallelization
inferred← citeshttps://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation
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.