On the public citation graph

Parallel algorithms for analyzing activity networks

https://doi.org/10.1007/bf01935049
0 signed · 24 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.1975.5.3.299openalex-snapshot
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
inferredcites →https://doi.org/10.1007/bf01937481openalex-snapshot
A parallel search algorithm for directed acyclic graphs
inferredcites →https://doi.org/10.1007/bf02136031openalex-snapshot
Graph algorithms on a tree-structured parallel computer
inferredcites →https://doi.org/10.1007/bf02254849openalex-snapshot
Parallel algorithms for the single source shortest path problem
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0377-2217(78)90126-1openalex-snapshot
Introduction to operations research — A computer-oriented algorithmic approach
inferredcites →https://doi.org/10.1080/00207218608920823openalex-snapshot
Distributed algorithm for analysing activity networks
inferredcites →https://doi.org/10.1109/proc.1975.9996openalex-snapshot
Graph theory with applications to engineering and computer science
inferredcites →https://doi.org/10.1137/0210049openalex-snapshot
Parallel Matrix and Graph Algorithms
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1145/800070.802209openalex-snapshot
Routing, merging and sorting on parallel models of computation
inferredcites →https://doi.org/10.1145/828.322449openalex-snapshot
Graph Problems on a Mesh-Connected Processor Array

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf01934690openalex-snapshot
Fast parallel graph searching with applications
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90197-popenalex-snapshot
Reducing conflict resolution time for solving graph problems in broadcast communications
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00037-3openalex-snapshot
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00135-2openalex-snapshot
Algorithms for finding and updating minimum-depth spanning trees in parallel
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90037-6openalex-snapshot
An adaptive parallel algorithm for analyzing activity networks
inferred← citeshttps://doi.org/10.1023/a:1018946232721openalex-snapshot
Work patterns in project scheduling
inferred← citeshttps://doi.org/10.1080/00207169408804331openalex-snapshot
On the Parallel Evaluation of Dwba Integrals
inferred← citeshttps://doi.org/10.1080/00207219008921232openalex-snapshot
Parallel algorithm for analysing activity networks on a tree-structured computer
inferred← citeshttps://doi.org/10.1080/01495739808947365openalex-snapshot
PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
inferred← citeshttps://doi.org/10.1109/12.61071openalex-snapshot
Parallel graph algorithms based upon broadcast communications
inferred← citeshttps://doi.org/10.1109/aispas.1997.581703openalex-snapshot
Efficient parallel and distributed topological sort algorithms
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.