On the public citation graph
Finding triconnected components by local replacements
0 signed · 50 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/bfb0040371openalex-snapshot
Efficient parallel triconnectivity in logarithmic time
inferredcites →https://doi.org/10.1007/bfb0040379openalex-snapshot
On finding lowest common ancestors: Simplification and parallelization
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity 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.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
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.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0211024openalex-snapshot
Parallel Algorithms in Graph Theory: Planarity Testing
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1145/28395.28431openalex-snapshot
A new graphy triconnectivity algorithm and its parallelization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1998.0943openalex-snapshot
A Randomized Parallel Algorithm for Planar Graph Isomorphism
inferred← citeshttps://doi.org/10.1006/jagm.1998.0991openalex-snapshot
Fast Algorithms forK4Immersion Testing
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_26openalex-snapshot
Simpler and Faster Vertex-Connectivity Augmentation Algorithms
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-57182-5_42openalex-snapshot
Efficient parallel graph algorithms based on open ear decomposition
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_42openalex-snapshot
Optimal upward planarity testing of single-source digraphs
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/bf01961541openalex-snapshot
On-Line Maintenance of Triconnected Components with SPQR-Trees
inferred← citeshttps://doi.org/10.1007/bfb0032061openalex-snapshot
On-line graph algorithms with SPQR-trees
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90161-popenalex-snapshot
Coloring algorithms for K5-minor free graphs
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90088-4openalex-snapshot
Parallel search algorithms for graphs and trees
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/0304-3975(94)00189-popenalex-snapshot
Optimal parallel algorithms for path problems on planar graphs
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/aiccsa.2005.1387014openalex-snapshot
Determining all pairs edge connectivity of a 4-regular graph in O(|V|)
inferred← citeshttps://doi.org/10.1109/glsv.1992.218363openalex-snapshot
Cutwidth approximation in linear time
inferred← citeshttps://doi.org/10.1109/ispan.1994.367159openalex-snapshot
Parallel connectivity algorithms on permutation graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63491openalex-snapshot
An optimal parallel algorithm for graph planarity
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63492openalex-snapshot
Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63494openalex-snapshot
Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185440openalex-snapshot
A deterministic parallel algorithm for planar graphs isomorphism
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/0220022openalex-snapshot
Efficient Parallel Algorithms for Testing k and Finding Disjoint s - t Paths in Graphs
inferred← citeshttps://doi.org/10.1137/0220070openalex-snapshot
Parallel Tree Contraction Part 2: Further Applications
inferred← citeshttps://doi.org/10.1137/0221032openalex-snapshot
Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
inferred← citeshttps://doi.org/10.1137/0222017openalex-snapshot
Recursive Star-Tree Parallel Data Structure
inferred← citeshttps://doi.org/10.1137/0222040openalex-snapshot
Finding Triconnected Components by Local Replacement
inferred← citeshttps://doi.org/10.1137/s0097539794279626openalex-snapshot
Optimal Upward Planarity Testing of Single-Source Digraphs
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/103418.103460openalex-snapshot
Algorithms for parallel k -vertex connectivity and sparse certificates
inferred← citeshttps://doi.org/10.1145/97444.97687openalex-snapshot
A randomized parallel algorithm for planar graph isomorphism
inferred← citeshttps://doi.org/10.5555/127787.127824openalex-snapshot
On finding minimal 2-connected subgraphs
inferred← citeshttps://doi.org/10.7936/k7b856cdopenalex-snapshot
A Simple Algorithm For Triconnectivity of a Multigraph
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.