On the public citation graph

A New Parallel Algorithm for the Maximal Independent Set Problem

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/bf02579338openalex-snapshot
Sorting inc logn parallel steps
inferredcites →https://doi.org/10.1016/0020-0190(86)90141-9openalex-snapshot
An improved parallel algorithm for maximal matching
inferredcites →https://doi.org/10.1016/0020-0190(86)90144-4openalex-snapshot
A fast and simple randomized parallel algorithm for maximal matching
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/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1109/tc.1981.6312171openalex-snapshot
A fast parallel algorithm for routing in permutation networks
inferredcites →https://doi.org/10.1137/0204030openalex-snapshot
Parallelism in Comparison Problems
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple 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.1993.1046openalex-snapshot
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
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-52048-1_29openalex-snapshot
Fast parallel approximations of the maximum weighted cut problem through derandomization
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_47openalex-snapshot
A fast parallel algorithm for finding a maximal bipartite set
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_12openalex-snapshot
Using maximal independent sets to solve problems in parallel
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_73openalex-snapshot
An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
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-0-387-30165-5_30openalex-snapshot
Graph Domination, Coloring and Cliques in Telecommunications
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-57855-8_3openalex-snapshot
An Incremental Algorithm for Computing All Repairs in Inconsistent Knowledge Bases
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/bf01098364openalex-snapshot
The maximum clique problem
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/s00446-020-00376-1openalex-snapshot
Derandomizing local distributed algorithms under bandwidth restrictions
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90031-popenalex-snapshot
A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
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(94)90104-xopenalex-snapshot
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
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/0304-3975(95)00056-3openalex-snapshot
The fourth moment in Luby's distribution
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.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.ipl.2006.03.005openalex-snapshot
Approximating weighted matchings in parallel
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.1016/s0304-3975(96)00135-1openalex-snapshot
Finding optimal subgraphs by local search
inferred← citeshttps://doi.org/10.1080/1063719042000208827openalex-snapshot
o(log4 n) time parallel maximal matching algorithm using linear number of processors
inferred← citeshttps://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferred← citeshttps://doi.org/10.1109/72.80251openalex-snapshot
Parallel algorithms for finding a near-maximum independent set of a circle graph
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00257openalex-snapshot
NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/ictmicc.2007.4448587openalex-snapshot
Radio network planning models based on teletraffic demand: Design, implementation and improvement issues
inferred← citeshttps://doi.org/10.1109/pact.2019.00040openalex-snapshot
A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00103openalex-snapshot
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
inferred← citeshttps://doi.org/10.1109/soac.1991.143847openalex-snapshot
A parallel algorithm for the independent set problem
inferred← citeshttps://doi.org/10.1109/spdp.1991.218242openalex-snapshot
On a fast deterministic parallel approximate matching algorithm
inferred← citeshttps://doi.org/10.1137/0401044openalex-snapshot
Parallel Symmetry-Breaking in Sparse Graphs
inferred← citeshttps://doi.org/10.1137/0402028openalex-snapshot
Constructing a Maximal Independent Set in Parallel
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/s0097539790192702openalex-snapshot
A Fast Derandomization Scheme and Its Applications
inferred← citeshttps://doi.org/10.1137/s0097539791224509openalex-snapshot
Computing Minimal Spanning Subgraphs in Linear Time
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.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.1145/1007912.1007934openalex-snapshot
An NC algorithm for finding a maximal acyclic set in a graph
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/2312005.2312058openalex-snapshot
Greedy sequential maximal independent set and matching are parallel on average
inferred← citeshttps://doi.org/10.1145/2612669.2612673openalex-snapshot
Executing dynamic data-graph computations deterministically using chromatic scheduling
inferred← citeshttps://doi.org/10.1145/2612669.2612697openalex-snapshot
Ordering heuristics for parallel graph coloring
inferred← citeshttps://doi.org/10.1145/2896850openalex-snapshot
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling
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/3350755.3400282openalex-snapshot
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
inferred← citeshttps://doi.org/10.1145/378580.378622openalex-snapshot
Finding large independent sets of hypergraphs in parallel
inferred← citeshttps://doi.org/10.1201/9781003033707-18openalex-snapshot
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling
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.14288/1.0052039openalex-snapshot
Geometric hierarchies and parallel subdivision search
inferred← citeshttps://doi.org/10.1541/ieejeiss.125.314openalex-snapshot
Maximum Neural Network with Nonlinear Self-Feedback and Its Application to Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05124openalex-snapshot
Tight Analysis of Randomized Greedy MIS
inferred← citeshttps://doi.org/10.5555/127787.127824openalex-snapshot
On finding minimal 2-connected subgraphs
inferred← citeshttps://doi.org/10.5555/320176.320200openalex-snapshot
Parallel search for maximal independence given minimal dependence
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
inferred← citeshttps://doi.org/10.7146/brics.v2i15.19883openalex-snapshot
The Fourth Moment in Luby's Distribution
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.