On the public citation graph

Constructing a Maximal Independent Set in Parallel

0 signed · 94 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.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf02579338openalex-snapshot
Sorting inc logn parallel steps
inferredcites →https://doi.org/10.1016/0022-0000(93)90033-sopenalex-snapshot
Removing randomness in parallel computation without a processor penalty
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.1109/sfcs.1979.29openalex-snapshot
On simultaneous resource bounds
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1109/sfcs.1985.9openalex-snapshot
An optimal parallel algorithm for integer sorting
inferredcites →https://doi.org/10.1109/sfcs.1986.41openalex-snapshot
Parallel merge sort
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0218029openalex-snapshot
A New Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1145/800057.808690openalex-snapshot
A fast parallel algorithm for the maximal independent set problem
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.1002/(sici)1098-2418(199805)12:3<297::aid-rsa5>3.0.co;2-qopenalex-snapshot
An algorithmic version of the blow-up lemma
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199805)12:3<297::aid-rsa5>3.3.co;2-wopenalex-snapshot
An algorithmic version of the blow‐up lemma
inferred← citeshttps://doi.org/10.1006/jagm.1996.0836openalex-snapshot
Parallel and On-Line Graph Coloring
inferred← citeshttps://doi.org/10.1006/jagm.1997.0884openalex-snapshot
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
inferred← citeshttps://doi.org/10.1006/jcss.1998.1572openalex-snapshot
Optimal Circular Arc Representations: Properties, Recognition, and Construction
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0005openalex-snapshot
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
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/3-540-53414-8_43openalex-snapshot
Optimal parallel 3-colouring algorithm for rooted trees and its application
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_186openalex-snapshot
Logarithmic time NC algorithms for comparability graphs and circle graphs
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_58openalex-snapshot
Parallel and on-line graph coloring algorithms
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_91openalex-snapshot
Fast parallel constraint satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_261openalex-snapshot
Parallel construction of canonical ordering and convex drawing of triconnected planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_55openalex-snapshot
The parallel complexity of elimination ordering procedures
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_51openalex-snapshot
The maximal f-dependent set problem for planar graphs is in NC
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_1openalex-snapshot
Network Decomposition and Distributed Derandomization (Invited Paper)
inferred← citeshttps://doi.org/10.1007/bf01098364openalex-snapshot
The maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf01262403openalex-snapshot
An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
inferred← citeshttps://doi.org/10.1007/bfb0020470openalex-snapshot
Optimal circular arc representations
inferred← citeshttps://doi.org/10.1007/bfb0024508openalex-snapshot
A measure of parallelization for the lexicographically first maximal subgraph problems
inferred← citeshttps://doi.org/10.1007/bfb0028260openalex-snapshot
A fast derandomization scheme and its applications
inferred← citeshttps://doi.org/10.1007/pl00009178openalex-snapshot
Parallel Algorithms for Maximal Acyclic Sets
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90063-hopenalex-snapshot
Fast parallel constraint satisfaction
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90045-wopenalex-snapshot
Optimal parallel 3-coloring algorithm for rooted trees and its applications
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90228-nopenalex-snapshot
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90055-eopenalex-snapshot
Approximating matchings in parallel
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90130-9openalex-snapshot
An optimal parallel algorithm for maximal matching
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00040-3openalex-snapshot
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00128-zopenalex-snapshot
Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00112-vopenalex-snapshot
The maximal f-dependent set problem for planar graphs is in NC
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00221-4openalex-snapshot
Using maximal independent sets to solve problems in parallel
inferred← citeshttps://doi.org/10.1016/j.csi.2018.07.004openalex-snapshot
An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.041openalex-snapshot
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
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.1016/j.tcs.2007.03.005openalex-snapshot
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1080/10637199708915621openalex-snapshot
OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
inferred← citeshttps://doi.org/10.1109/hipc.2017.00016openalex-snapshot
Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091032openalex-snapshot
Distributed-memory fast maximal independent set
inferred← citeshttps://doi.org/10.1109/icics.2009.5397523openalex-snapshot
Throughput performance of d-tree multicast capable optical cross-connect under synchronous traffic
inferred← citeshttps://doi.org/10.1109/ipps.1996.508059openalex-snapshot
Constructing the spanners of graphs in parallel
inferred← citeshttps://doi.org/10.1109/ispan.1996.508954openalex-snapshot
Optimal overlap representations
inferred← citeshttps://doi.org/10.1109/ispdc69862.2026.00020openalex-snapshot
Distributed Maximal Independent Set Computation in Hundred Billion-Edge Graphs
inferred← citeshttps://doi.org/10.1109/soac.1991.143847openalex-snapshot
A parallel algorithm for the independent set problem
inferred← citeshttps://doi.org/10.1137/0406036openalex-snapshot
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size
inferred← citeshttps://doi.org/10.1137/s0097539789162997openalex-snapshot
Flow in Planar Graphs with Multiple Sources and Sinks
inferred← citeshttps://doi.org/10.1137/s0097539790192702openalex-snapshot
A Fast Derandomization Scheme and Its Applications
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.1142/s0129626400000251openalex-snapshot
AN EFFICIENT INCREMENTAL ALGORITHM FOR GENERATING ALL MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS OF BOUNDED DIMENSION
inferred← citeshttps://doi.org/10.1142/s0129626407002934openalex-snapshot
COMPUTING MANY MAXIMAL INDEPENDENT SETS FOR HYPERGRAPHS IN PARALLEL
inferred← citeshttps://doi.org/10.1142/s1793830913500134openalex-snapshot
AN EFFICIENT NC ALGORITHM FOR APPROXIMATE MAXIMUM WEIGHT MATCHING
inferred← citeshttps://doi.org/10.1145/129712.129745openalex-snapshot
On the parallel complexity of computing a maximal independent set in a hypergraph
inferred← citeshttps://doi.org/10.1145/165231.165237openalex-snapshot
On Gazit and Miller's parallel algorithm for planar separators
inferred← citeshttps://doi.org/10.1145/165231.165247openalex-snapshot
Deterministic distribution sort in shared and distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1145/165231.166107openalex-snapshot
Fast parallel matching in expander graphs
inferred← citeshttps://doi.org/10.1145/2312005.2312058openalex-snapshot
Greedy sequential maximal independent set and matching are parallel on average
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018788openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3018787.3018789openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3018787.3018790openalex-snapshot
Preliminaries and Notation
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018803openalex-snapshot
Conclusion and Future Work
inferred← citeshttps://doi.org/10.1145/3018787.3018804openalex-snapshot
References
inferred← citeshttps://doi.org/10.1145/3326165openalex-snapshot
Tight Analysis of Parallel Randomized Greedy MIS
inferred← citeshttps://doi.org/10.1145/3816782.3819181openalex-snapshot
Efficient Parallel (Δ + 1)-Edge-Coloring
inferred← citeshttps://doi.org/10.1201/9781420011296.ch18openalex-snapshot
Parallel Algorithms via the Probabilistic Method
inferred← citeshttps://doi.org/10.1201/9781420011296.ch25openalex-snapshot
Parallel Algorithms for Maximal Independent Set and Maximal Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05124openalex-snapshot
Tight Analysis of Randomized Greedy MIS
inferred← citeshttps://doi.org/10.5555/313651.313687openalex-snapshot
Approximating discrete collections via local improvements
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.