On the public citation graph
A new graph triconnectivity algorithm and its parallelization
0 signed · 66 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.1016/0022-0000(91)90004-oopenalex-snapshot
Improved algorithms for graph four- connectivity
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-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferredcites →https://doi.org/10.1090/s0002-9947-1932-1501641-2openalex-snapshot
Non-separable and planar graphs
inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferredcites →https://doi.org/10.1109/sfcs.1985.16openalex-snapshot
Computing ears and branchings in parallel
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.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.1002/jgt.21635openalex-snapshot
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
inferred← citeshttps://doi.org/10.1007/11758471_26openalex-snapshot
Distance Approximating Trees: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_8openalex-snapshot
1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_29openalex-snapshot
Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_1openalex-snapshot
Progress on Certifying Algorithms
inferred← citeshttps://doi.org/10.1007/s00224-015-9645-1openalex-snapshot
Counting the Number of Perfect Matchings in K 5-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9481-2openalex-snapshot
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/s10489-014-0560-yopenalex-snapshot
Conflict-based pruning of a solution space within a constructive geometric constraint solver
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90284-mopenalex-snapshot
The decomposition of graphs into k-connected components
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90156-2openalex-snapshot
Data structures for two-edge connectivity in planar graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90031-copenalex-snapshot
Extending planar graph algorithms to K3,3-free graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.cad.2014.02.006openalex-snapshot
Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.12.001openalex-snapshot
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
inferred← citeshttps://doi.org/10.1016/j.jocs.2016.10.005openalex-snapshot
Fast determination of structurally cohesive subgroups in large networks
inferred← citeshttps://doi.org/10.1016/s0010-4485(03)00057-5openalex-snapshot
Revisiting decomposition analysis of geometric constraint graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80070-4openalex-snapshot
Planarity testing in parallel
inferred← citeshttps://doi.org/10.1093/comjnl/bxm033openalex-snapshot
The Bidimensionality Theory and Its Algorithmic Applications
inferred← citeshttps://doi.org/10.1109/31.1743openalex-snapshot
Parallel algorithms for planar graph isomorphism and related problems
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/ccc.2014.15openalex-snapshot
Counting the Number of Perfect Matchings in K5-Free Graphs
inferred← citeshttps://doi.org/10.1109/hipc.2014.7116914openalex-snapshot
Simple parallel biconnectivity algorithms for multicore platforms
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/infcom.2004.1354686openalex-snapshot
Rigidity, computation, and randomization in network localization
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00031openalex-snapshot
Efficient Distributed Algorithms in the k-machine model via PRAM Simulations
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205000openalex-snapshot
Generation of wave digital structures for connection networks containing ideal transformers
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.1989.63493openalex-snapshot
The parallel complexity of the subgraph connectivity problem
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.1109/synasc.2005.2openalex-snapshot
A connectivity analysis approach in geometric constraint solving
inferred← citeshttps://doi.org/10.1109/tcsi.2004.843056openalex-snapshot
Generation of wave digital structures for networks containing multiport elements
inferred← citeshttps://doi.org/10.1109/tmc.2006.174openalex-snapshot
A Theory of Network Localization
inferred← citeshttps://doi.org/10.1137/0221008openalex-snapshot
Conditions for Unique Graph Realizations
inferred← citeshttps://doi.org/10.1145/1629255.1629270openalex-snapshot
Treedecomposition of geometric constraint graphs based on computing graph circuits
inferred← citeshttps://doi.org/10.1145/2000807.2000814openalex-snapshot
Fast computation of small cuts via cycle space sampling
inferred← citeshttps://doi.org/10.1145/3210377.3210414openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3350755.3400259openalex-snapshot
Parallel Planar Subgraph Isomorphism and Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/3434393openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3543686openalex-snapshot
Planar Graph Isomorphism Is in Log-Space
inferred← citeshttps://doi.org/10.1145/566282.566300openalex-snapshot
Revisiting decomposition analysis of geometric constraint graphs
inferred← citeshttps://doi.org/10.1177/1550147717748898openalex-snapshot
The effects of random geometric graph structure and clustering on localizability of sensor networks
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4159openalex-snapshot
Connectivity Oracles for Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702113openalex-snapshot
Fast Computation of Small Cuts via Cycle Space Sampling
inferred← citeshttps://doi.org/10.5821/dissertation-2117-360343openalex-snapshot
Contribution to geometric constraint solving in cooperative engineering
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95581openalex-snapshot
Direct tree decomposition of geometric constraint 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.