On the public citation graph

Distributed Approximate Matching

0 signed · 59 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/11780823_10openalex-snapshot

Efficient Distributed Weighted Matchings on Trees

inferredcites →https://doi.org/10.1007/978-3-540-30186-8_24openalex-snapshot

Distributed Weighted Matching

inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot

Constructing a perfect matching is in random NC

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/0020-0190(93)90055-eopenalex-snapshot

Approximating matchings in parallel

inferredcites →https://doi.org/10.1137/0202019openalex-snapshot

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot

Distributed Computing: A Locality-Sensitive Approach

inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot

Paths, Trees, and Flowers

inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot

Maximum matching and a polyhedron with 0,1-vertices

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-87756-9_24openalex-snapshot

Multi-agent Reinforcement Learning for Decentralized Stable Matching

inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_10openalex-snapshot

Constant-Time Local Computation Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_7openalex-snapshot

New Bounds for the Controller Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_15openalex-snapshot

Distributed 2-Approximation Algorithm for the Semi-matching Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_16openalex-snapshot

On the Impact of Identifiers on Local Decision

inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_30openalex-snapshot

Almost-Tight Distributed Minimum Cut Algorithms

inferred← citeshttps://doi.org/10.1007/s00224-017-9788-3openalex-snapshot

Constant-Time Local Computation Algorithms

inferred← citeshttps://doi.org/10.1007/s00446-010-0100-xopenalex-snapshot

Fast primal-dual distributed algorithms for scheduling and matching problems

inferred← citeshttps://doi.org/10.1007/s00446-010-0119-zopenalex-snapshot

New bounds for the controller problem

inferred← citeshttps://doi.org/10.1007/s00446-012-0174-8openalex-snapshot

Toward more localized local algorithms: removing assumptions concerning global knowledge

inferred← citeshttps://doi.org/10.1007/s00446-025-00496-6openalex-snapshot

Narrowing the LOCAL–CONGEST gaps in sparse networks via expander decompositions

inferred← citeshttps://doi.org/10.1007/s00453-016-0126-yopenalex-snapshot

Local Computation Algorithms for Graphs of Non-constant Degrees

inferred← citeshttps://doi.org/10.1016/j.eswa.2018.10.001openalex-snapshot

A distributed and asynchronous approach for optimizing weighted graph matchings in wireless network services

inferred← citeshttps://doi.org/10.1016/j.jcss.2016.05.001openalex-snapshot

On the distributed complexity of the semi-matching problem

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.032openalex-snapshot

A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2

inferred← citeshttps://doi.org/10.1038/s41598-018-22655-5openalex-snapshot

Enabling Controlling Complex Networks with Local Topological Information

inferred← citeshttps://doi.org/10.1109/blackseacom.2017.8277709openalex-snapshot

Improving distributed maximum weighted matchings for communication networks

inferred← citeshttps://doi.org/10.1109/dictap.2016.7544009openalex-snapshot

Performance evaluation of distributed maximum weighted matching algorithms

inferred← citeshttps://doi.org/10.1109/focs.2011.17openalex-snapshot

Local Distributed Decision

inferred← citeshttps://doi.org/10.1109/focs.2016.43openalex-snapshot

Fully Dynamic Maximal Matching in Constant Update Time

inferred← citeshttps://doi.org/10.1109/focs.2019.00048openalex-snapshot

Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs

inferred← citeshttps://doi.org/10.1109/focs.2019.00096openalex-snapshot

Exponentially Faster Massively Parallel Maximal Matching

inferred← citeshttps://doi.org/10.1109/sc.2016.65openalex-snapshot

Designing Scalable b-MATCHING Algorithms on Distributed Memory Multiprocessors by Approximation

inferred← citeshttps://doi.org/10.1109/tmc.2018.2846246openalex-snapshot

Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology

inferred← citeshttps://doi.org/10.1109/tnet.2009.2017742openalex-snapshot

On Stability Region and Delay Performance of Linear-Memory Randomized Scheduling for Time-Varying Networks

inferred← citeshttps://doi.org/10.1137/16m1097808openalex-snapshot

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths

inferred← citeshttps://doi.org/10.1137/20m1312782openalex-snapshot

Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time

inferred← citeshttps://doi.org/10.1145/1378533.1378558openalex-snapshot

Improved distributed approximate matching

inferred← citeshttps://doi.org/10.1145/1993806.1993814openalex-snapshot

Toward more localized local algorithms

inferred← citeshttps://doi.org/10.1145/2499228openalex-snapshot

Towards a complexity theory for local distributed computing

inferred← citeshttps://doi.org/10.1145/2591796.2591850openalex-snapshot

Distributed approximation algorithms for weighted shortest paths

inferred← citeshttps://doi.org/10.1145/2755573.2755615openalex-snapshot

Local Computation Algorithms for Graphs of Non-Constant Degrees

inferred← citeshttps://doi.org/10.1145/2786753openalex-snapshot

Improved Distributed Approximate Matching

inferred← citeshttps://doi.org/10.1145/3087801.3087806openalex-snapshot

Distributed Approximation of Maximum Independent Set and Maximum Matching

inferred← citeshttps://doi.org/10.1145/3212734.3212743openalex-snapshot

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

inferred← citeshttps://doi.org/10.1145/3313276.3316326openalex-snapshot

Distributed exact weighted all-pairs shortest paths in near-linear time

inferred← citeshttps://doi.org/10.1145/3583668.3594562openalex-snapshot

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs

inferred← citeshttps://doi.org/10.1145/3583668.3594570openalex-snapshot

(1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings

inferred← citeshttps://doi.org/10.1145/3617360openalex-snapshot

Exponentially Faster Massively Parallel Maximal Matching

inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot

Time- and space-efficient self-stabilizing algorithms

inferred← citeshttps://doi.org/10.25777/e1r5-yp32openalex-snapshot

Algorithms for Vertex-Weighted Matching in Graphs

inferred← citeshttps://doi.org/10.4230/lipics.disc.2018.6openalex-snapshot

Distributed Approximate Maximum Matching in the CONGEST Model

inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.37openalex-snapshot

Distributed Maximum Matching Verification in CONGEST

inferred← citeshttps://doi.org/10.4230/lipics.icalp.2017.6openalex-snapshot

Best of Two Local Models: Local Centralized and Local Distributed Algorithms

inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.7openalex-snapshot

Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems

inferred← citeshttps://doi.org/10.4230/lipics.opodis.2021.17openalex-snapshot

Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings

inferred← citeshttps://doi.org/10.48550/arxiv.1403.5171openalex-snapshot

Distributed Approximation Algorithms for Weighted Shortest Paths

inferred← citeshttps://doi.org/10.48550/arxiv.1807.06701openalex-snapshot

Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching

inferred← citeshttps://doi.org/10.48550/arxiv.2105.09756openalex-snapshot

Fully Adaptive Self-Stabilizing Transformer for LCL Problems

inferred← citeshttps://doi.org/10.5555/2884435.2884486openalex-snapshot

Dynamic (1 + ε)-approximate matchings: a density-sensitive approach

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.