On the public citation graph
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
0 signed · 87 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/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1109/tc.1973.5009159openalex-snapshot
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
inferredcites →https://doi.org/10.1137/0207020openalex-snapshot
Parallel Computations in Graph Theory
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
inferredcites →https://doi.org/10.1137/0211024openalex-snapshot
Parallel Algorithms in Graph Theory: Planarity Testing
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/358628.358650openalex-snapshot
Efficient parallel algorithms for some graph problems
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1622openalex-snapshot
A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0035openalex-snapshot
Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_27openalex-snapshot
O(1) parallel time incremental graph algorithms
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_92openalex-snapshot
A parallel vertex insertion algorithm for minimum spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_52openalex-snapshot
Parallel algorithms for approximate edge colouring of simple graphs
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_36openalex-snapshot
An efficient distributed algorithm for finding articulation points, Bridges, and biconnected components in asynchronous networks
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_194openalex-snapshot
A simple optimal parallel algorithm to solve the lowest common ancestor problem
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_9openalex-snapshot
Parallel pruning decomposition (PDS) and biconnected components of graphs
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/bf01086177openalex-snapshot
Graph theory (algorithmic, algebraic, and metric problems)
inferred← citeshttps://doi.org/10.1007/bf02669835openalex-snapshot
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
inferred← citeshttps://doi.org/10.1007/bf02948795openalex-snapshot
Efficient minimum spanning tree algorithms on the reconfigurable mesh
inferred← citeshttps://doi.org/10.1007/bf03008943openalex-snapshot
Efficient algorithms to compute all articulation points of a permutation graph
inferred← citeshttps://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferred← citeshttps://doi.org/10.1007/bfb0039596openalex-snapshot
Efficient graph algorithms using limited communication on a fixed-size array of processors
inferred← citeshttps://doi.org/10.1007/s004460050055openalex-snapshot
A self-stabilizing algorithm for bridge finding
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90112-6openalex-snapshot
A general program scheme for finding bridges
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90082-1openalex-snapshot
An optimal parallel processor bound in strong orientation of an undirected graph
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90098-0openalex-snapshot
An O(log n) algorithm for parallel update of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90136-0openalex-snapshot
Computing dominators in parallel
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90244-popenalex-snapshot
Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90247-sopenalex-snapshot
Deciding whether graph G has page number one is in NC
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90004-ropenalex-snapshot
Distributed processing of graphs: Fundamental cycles algorithm
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/0020-0255(94)90090-6openalex-snapshot
An efficient distributed bridge-finding algorithm
inferred← citeshttps://doi.org/10.1016/0165-6074(94)90013-2openalex-snapshot
Enhanced systolic array implementations of some graph problems
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90086-mopenalex-snapshot
A fast cost-optimal parallel algorithm for the lowest common ancestor problem
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00007-bopenalex-snapshot
Optimal algorithms for computing articulation points and some related problems on a circular-arc graph
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90035-7openalex-snapshot
An efficient parallel algorithm for updating minimum spanning trees
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90034-fopenalex-snapshot
Optimal parallel algorithms on planar graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90019-xopenalex-snapshot
Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel 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.1016/j.dam.2007.03.016openalex-snapshot
On the parallel computation of the biconnected and strongly connected co-components of graphs
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80046-8openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60006-6openalex-snapshot
Parallel Algorithms for Some Computational Problems
inferred← citeshttps://doi.org/10.1016/s0140-3664(98)00211-4openalex-snapshot
An optimal distributed algorithm for finding articulation points in a network
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73240-7openalex-snapshot
Parallel Computer Models and Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1023/b:coap.0000004982.13444.bcopenalex-snapshot
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
inferred← citeshttps://doi.org/10.1051/ita/1995290604511openalex-snapshot
Parallel algorithms on interval graphs
inferred← citeshttps://doi.org/10.1080/00207160008804965openalex-snapshot
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
inferred← citeshttps://doi.org/10.1080/00207169408804331openalex-snapshot
On the Parallel Evaluation of Dwba Integrals
inferred← citeshttps://doi.org/10.1080/00207169908804868openalex-snapshot
An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
inferred← citeshttps://doi.org/10.1080/00207219308907182openalex-snapshot
Distributed algorithm for finding the bridges of an undirected graph
inferred← citeshttps://doi.org/10.1080/10637199408962525openalex-snapshot
FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
inferred← citeshttps://doi.org/10.1080/10637199608915561openalex-snapshot
PARALLEL BLOCK-FINDING USING DISTANCE MATRICES
inferred← citeshttps://doi.org/10.1109/21.281425openalex-snapshot
A bibliography of heuristic search research through 1992
inferred← citeshttps://doi.org/10.1109/31.1744openalex-snapshot
Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
inferred← citeshttps://doi.org/10.1109/71.80177openalex-snapshot
Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems
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/aispas.1997.581705openalex-snapshot
A parallel algorithm for k-minimum spanning trees
inferred← citeshttps://doi.org/10.1109/hipc.2014.7116914openalex-snapshot
Simple parallel biconnectivity algorithms for multicore platforms
inferred← citeshttps://doi.org/10.1109/icpads.1994.590315openalex-snapshot
Parallel algorithms for verification and sensitivity analysis of minimum spanning trees
inferred← citeshttps://doi.org/10.1109/icpads.2001.934806openalex-snapshot
Optimal parallel algorithms for cut vertices, bridges, and Hamiltonian path in bounded interval tolerance graphs
inferred← citeshttps://doi.org/10.1109/icpp.1993.91openalex-snapshot
Finding Articulation Points and Bridges of Permutation Graphs
inferred← citeshttps://doi.org/10.1109/ipdps.2005.100openalex-snapshot
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00032openalex-snapshot
Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.31openalex-snapshot
A Simple Parallel Algorithm for Biconnected Components in Sparse Graphs
inferred← citeshttps://doi.org/10.1109/ispan.1996.508997openalex-snapshot
Computing dominators and its applications on processor arrays with reconfigurable bus systems
inferred← citeshttps://doi.org/10.1109/padsw.2000.884511openalex-snapshot
Domination in bounded interval tolerance graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferred← citeshttps://doi.org/10.1109/sfcs.1985.53openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferred← citeshttps://doi.org/10.1109/tc.1986.1676830openalex-snapshot
Finding Lowest Common Ancestors in Parallel
inferred← citeshttps://doi.org/10.1109/tc.1987.1676928openalex-snapshot
Optimal Graph Algorithms on a Fixed-Size Linear Array
inferred← citeshttps://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferred← citeshttps://doi.org/10.1145/327164.327204openalex-snapshot
Efficient parallel algorithms for finding biconnected components of some intersection graphs
inferred← citeshttps://doi.org/10.1145/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
inferred← citeshttps://doi.org/10.1145/3369583.3392690openalex-snapshot
Aquila: Adaptive Parallel Computation of Graph Connectivity Queries
inferred← citeshttps://doi.org/10.1145/3572848.3577483openalex-snapshot
Provably Fast and Space-Efficient Parallel Biconnectivity
inferred← citeshttps://doi.org/10.1145/3802084openalex-snapshot
Maintaining Biconnected Components in Streaming Graphs
inferred← citeshttps://doi.org/10.1145/72935.72975openalex-snapshot
Efficient parallel algorithms for path problems in directed graphs
inferred← citeshttps://doi.org/10.1145/800057.808686openalex-snapshot
Randomized speed-ups in parallel computation
inferred← citeshttps://doi.org/10.15803/ijnc.6.1_87openalex-snapshot
Efficient Multicore Algorithms For Identifying Biconnected Components
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.419openalex-snapshot
Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.314openalex-snapshot
Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid 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.