On the public citation graph
A las vegas rnc algorithm for maximum matching
0 signed · 46 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.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-642-68874-4openalex-snapshot
Mathematical Programming the State of the Art: Bonn 1982
inferredcites →https://doi.org/10.1007/bf01889914openalex-snapshot
On the structure of factorizable graphs
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1145/22145.22146openalex-snapshot
A simple 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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.1006/jagm.1996.0017openalex-snapshot
On the Complexity of Distributed Network Decomposition
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_78openalex-snapshot
On parallel complexity of maximum f-matching and the degree sequence problem
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/978-981-99-3761-5_57openalex-snapshot
A Brief Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/bf01961540openalex-snapshot
Designing checkers for programs that run in parallel
inferred← citeshttps://doi.org/10.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferred← citeshttps://doi.org/10.1007/bfb0020792openalex-snapshot
Tight RNC approximations to Max Flow
inferred← citeshttps://doi.org/10.1007/s00224-007-9018-5openalex-snapshot
Processor Efficient Parallel Matching
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90173-fopenalex-snapshot
Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90005-9openalex-snapshot
Maximum matchings in general graphs through randomization
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
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.ipl.2006.03.005openalex-snapshot
Approximating weighted matchings in parallel
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00196-8openalex-snapshot
A note on parallel complexity of maximum f-matching
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/s0927-0507(05)80205-1openalex-snapshot
Chapter 8 Design (with analysis) of efficient algorithms
inferred← citeshttps://doi.org/10.1080/10637199708915622openalex-snapshot
SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00157openalex-snapshot
Parallel Maximum Cardinality Matching for General Graphs on GPUs
inferred← citeshttps://doi.org/10.1109/sfcs.1987.56openalex-snapshot
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21936openalex-snapshot
Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs
inferred← citeshttps://doi.org/10.1137/0218076openalex-snapshot
The Two-Processor Scheduling Problem is in Random NC
inferred← citeshttps://doi.org/10.1137/070684008openalex-snapshot
Algebraic Algorithms for Matching and Matroid Problems
inferred← citeshttps://doi.org/10.1137/s0097539793250330openalex-snapshot
Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539793256223openalex-snapshot
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
inferred← citeshttps://doi.org/10.1145/1073970.1073994openalex-snapshot
Processor efficient parallel matching
inferred← citeshttps://doi.org/10.1145/167088.167213openalex-snapshot
Randomness-optimal unique element isolation, with applications to perfect matching and related problems
inferred← citeshttps://doi.org/10.1214/ss/1177011085openalex-snapshot
Randomization in Parallel Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2017.87openalex-snapshot
Bipartite Perfect Matching in Pseudo-Deterministic NC
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.97openalex-snapshot
NC Algorithms for Weighted Planar Perfect Matching and Related Problems
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
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.