On the public citation graph

An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size

0 signed · 29 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.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0217009openalex-snapshot
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
inferredcites →https://doi.org/10.1137/0218029openalex-snapshot
A New Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0402028openalex-snapshot
Constructing a Maximal Independent Set in Parallel
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation
inferredcites →https://doi.org/10.1145/79147.214077openalex-snapshot
An efficient and fast parallel-connected component algorithm
inferredcites →https://doi.org/10.4064/cm-3-1-19-30openalex-snapshot
On the theory of graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11816157_99openalex-snapshot
An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_21openalex-snapshot
Energy and Time Efficient Broadcasting in Known Topology Radio Networks
inferred← citeshttps://doi.org/10.1007/bfb0055806openalex-snapshot
Approximating maximum independent sets in uniform hypergraphs
inferred← citeshttps://doi.org/10.1007/s00446-008-0058-0openalex-snapshot
Time efficient k-shot broadcasting in known topology radio networks
inferred← citeshttps://doi.org/10.1007/s00446-017-0298-yopenalex-snapshot
Computing large independent sets in a single round
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.08.007openalex-snapshot
A simple proof that finding a maximal independent set in a graph is in
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.03.016openalex-snapshot
A distributed algorithm for a maximal 2-packing set in Halin graphs
inferred← citeshttps://doi.org/10.1109/tpami.2004.1273918openalex-snapshot
Learning to detect natural image boundaries using local brightness, color, and texture cues
inferred← citeshttps://doi.org/10.1137/s0097539797323716openalex-snapshot
The Algorithmic Aspects of Uncrowded Hypergraphs
inferred← citeshttps://doi.org/10.1137/s0895480102419731openalex-snapshot
Finding Large Independent Sets in Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1142/s0129065704002133openalex-snapshot
AN IMPROVED TRANSIENTLY CHAOTIC NEURAL NETWORK FOR THE MAXIMUM INDEPENDENT SET PROBLEM
inferred← citeshttps://doi.org/10.1145/1013367.1013513openalex-snapshot
Semantic api matching for automatic service composition
inferred← citeshttps://doi.org/10.1145/1062745.1062901openalex-snapshot
Semantic search of schema repositories
inferred← citeshttps://doi.org/10.1145/378580.378622openalex-snapshot
Finding large independent sets of hypergraphs in parallel
inferred← citeshttps://doi.org/10.3390/math10173040openalex-snapshot
Neural Fairness Blockchain Protocol Using an Elliptic Curves Lottery
inferred← citeshttps://doi.org/10.5555/314161.314311openalex-snapshot
The algorithmic aspects of uncrowded hypergraphs
inferred← citeshttps://doi.org/10.5555/365411.365535openalex-snapshot
New approaches to covering and packing problems
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.