On the public citation graph
A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm
0 signed · 146 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/bf02239502openalex-snapshot
A O(|V|·|E|) algorithm for maximum matching of graphs
inferredcites →https://doi.org/10.1007/bfb0032060openalex-snapshot
A new approach to maximum matching in general graphs
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1109/sfcs.1975.5openalex-snapshot
An O (N2.5) algorithm for maximum matching in general graphs
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/321941.321942openalex-snapshot
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
inferredcites →https://doi.org/10.6028/jres.069b.009openalex-snapshot
Modification of Edmonds' maximum matching algorithm
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)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-mopenalex-snapshot
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199901)33:1<29::aid-net2>3.0.co;2-uopenalex-snapshot
Balanced network flows. II. Simple augmentation algorithms
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199901)33:1<43::aid-net3>3.0.co;2-6openalex-snapshot
Balanced network flows. III. Strongly polynomial augmentation algorithms
inferred← citeshttps://doi.org/10.1002/9781118567869.ch18openalex-snapshot
Network Algorithms for Protein Interactions
inferred← citeshttps://doi.org/10.1002/jgt.21887openalex-snapshot
On the Complexity of Computing the Excessive [B]‐Index of a Graph
inferred← citeshttps://doi.org/10.1002/net.10030openalex-snapshot
Length‐constrained path‐matchings in graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1132openalex-snapshot
Efficient Algorithms for Petersen's Matching Theorem
inferred← citeshttps://doi.org/10.1007/11602613_61openalex-snapshot
Configurations with Few Crossings in Topological Graphs
inferred← citeshttps://doi.org/10.1007/11758525_98openalex-snapshot
A Multilevel Approach to Identify Functional Modules in a Yeast Protein-Protein Interaction Network
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_37openalex-snapshot
Evolutionary Algorithms and the Maximum Matching Problem
inferred← citeshttps://doi.org/10.1007/3-540-44867-5_9openalex-snapshot
Linear Time Local Improvements for Weighted Matchings in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_141openalex-snapshot
Maximum skew-symmetric flows
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_96openalex-snapshot
On the parallel complexity of the alternating Hamiltonian cycle problem
inferred← citeshttps://doi.org/10.1007/978-3-031-39344-0_6openalex-snapshot
On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree
inferred← citeshttps://doi.org/10.1007/978-3-319-13841-1_3openalex-snapshot
Inference-Proof Data Publishing by Minimally Weakening a Database Instance
inferred← citeshttps://doi.org/10.1007/978-3-319-45741-3_19openalex-snapshot
Information Control by Policy-Based Relational Weakening Templates
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_21openalex-snapshot
More on a Binary-Encoded Coloring Formulation
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_23openalex-snapshot
New Results for the 2-Interval Pattern Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_19openalex-snapshot
Engineering Algorithms for Approximate Weighted Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_17openalex-snapshot
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_9openalex-snapshot
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_25openalex-snapshot
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_24openalex-snapshot
The Balanced Edge Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_14openalex-snapshot
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_43openalex-snapshot
Planarizing Gadgets for Perfect Matching Do Not Exist
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_12openalex-snapshot
A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_3openalex-snapshot
An Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/bfb0032060openalex-snapshot
A new approach to maximum matching in general graphs
inferred← citeshttps://doi.org/10.1007/s00453-003-1035-4openalex-snapshot
Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size
inferred← citeshttps://doi.org/10.1007/s00453-010-9412-2openalex-snapshot
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00453-012-9625-7openalex-snapshot
Maximum Matching in Regular and Almost Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00949-5openalex-snapshot
Approximate Generalized Matching: f-Matchings and f-Edge Covers
inferred← citeshttps://doi.org/10.1007/s00454-014-9624-3openalex-snapshot
Efficiently Hex-Meshing Things with Topology
inferred← citeshttps://doi.org/10.1007/s004930170007openalex-snapshot
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
inferred← citeshttps://doi.org/10.1007/s10100-013-0309-4openalex-snapshot
Gallai-Edmonds decomposition as a pruning technique
inferred← citeshttps://doi.org/10.1007/s10107-004-0505-zopenalex-snapshot
Maximum skew-symmetric flows and matchings
inferred← citeshttps://doi.org/10.1007/s10479-009-0673-6openalex-snapshot
Variations of maximum-clique transversal sets on graphs
inferred← citeshttps://doi.org/10.1007/s10623-016-0201-zopenalex-snapshot
Affine-invariant strictly cyclic Steiner quadruple systems
inferred← citeshttps://doi.org/10.1007/s10817-026-09747-yopenalex-snapshot
A Formal Correctness Proof of Edmonds’ Blossom Shrinking Algorithm
inferred← citeshttps://doi.org/10.1007/s11432-013-4845-2openalex-snapshot
On the parameterized vertex cover problem for graphs with perfect matching
inferred← citeshttps://doi.org/10.1007/s12190-020-01463-zopenalex-snapshot
Matching numbers in fuzzy graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90165-popenalex-snapshot
Bounded vertex colorings of graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00113-8openalex-snapshot
Maximizing the number of unused colors in the vertex coloring problem
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90086-copenalex-snapshot
An introduction to randomized algorithms
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-044488002-4/50004-xopenalex-snapshot
10.1016/b978-044488002-4/50004-x
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.06.001openalex-snapshot
Configurations with few crossings in topological graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.09.006openalex-snapshot
Matchability and k -maximal matchings
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.059openalex-snapshot
Graph factors and factorization: 1985–2003: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2018.01.001openalex-snapshot
Online sum-paintability: The slow-coloring game
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114288openalex-snapshot
Large matchings in maximal 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104951openalex-snapshot
Linear-time parameterized algorithms with limited local resources
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.03.005openalex-snapshot
Approximating weighted matchings in parallel
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.010openalex-snapshot
A simple reduction from maximum weight matching to maximum cardinality matching
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.09.002openalex-snapshot
Graph properties checkable in linear time in the number of vertices
inferred← citeshttps://doi.org/10.1016/j.jda.2008.04.001openalex-snapshot
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
inferred← citeshttps://doi.org/10.1016/j.jda.2011.06.001openalex-snapshot
On weighted efficient total domination
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.002openalex-snapshot
Extracting constrained 2-interval subsets in 2-interval sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.024openalex-snapshot
A combinatoric interpretation of dual variables for weighted matching and f -factors
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.013openalex-snapshot
Complexity results for rainbow matchings
inferred← citeshttps://doi.org/10.1016/j.trc.2023.104158openalex-snapshot
Dynamic ride-sourcing systems for city-scale networks - Part I: Matching design and model formulation and validation
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00393-9openalex-snapshot
A simple approximation algorithm for the weighted matching problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00081-1openalex-snapshot
An O(n) time algorithm for maximum matching in P4-tidy graphs
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.1051/ita:2000108openalex-snapshot
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
inferred← citeshttps://doi.org/10.1109/focs.2006.8openalex-snapshot
Algebraic Structures and Algorithms for Matching and Matroid Problems
inferred← citeshttps://doi.org/10.1109/focs.2010.70openalex-snapshot
Approximating Maximum Weight Matching in Near-Linear Time
inferred← citeshttps://doi.org/10.1109/focs.2013.35openalex-snapshot
Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back
inferred← citeshttps://doi.org/10.1109/focs.2016.70openalex-snapshot
Computing Maximum Flow with Augmenting Electrical Flows
inferred← citeshttps://doi.org/10.1137/s0097539793256223openalex-snapshot
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
inferred← citeshttps://doi.org/10.1142/8591openalex-snapshot
Algorithmics of Matching Under Preferences
inferred← citeshttps://doi.org/10.1145/1077464.1077472openalex-snapshot
A linear-time approximation algorithm for weighted matchings in graphs
inferred← citeshttps://doi.org/10.1145/1103963.1103969openalex-snapshot
An O ( VE ) algorithm for ear decompositions of matching-covered graphs
inferred← citeshttps://doi.org/10.1145/1143997.1144095openalex-snapshot
Maximum cardinality matchings on trees by randomized local search
inferred← citeshttps://doi.org/10.1145/1721837.1721850openalex-snapshot
Efficient algorithms for the 2-gathering problem
inferred← citeshttps://doi.org/10.1145/2213977.2214028openalex-snapshot
Fast matrix rank algorithms and applications
inferred← citeshttps://doi.org/10.1145/2462356.2462403openalex-snapshot
Efficiently hex-meshing things with topology
inferred← citeshttps://doi.org/10.1145/2528404openalex-snapshot
Fast matrix rank algorithms and applications
inferred← citeshttps://doi.org/10.1145/2529989openalex-snapshot
Linear-Time Approximation for Maximum Weight Matching
inferred← citeshttps://doi.org/10.1145/2822890openalex-snapshot
Solving Linear Programs without Breaking Abstractions
inferred← citeshttps://doi.org/10.1145/2934310openalex-snapshot
Planarizing Gadgets for Perfect Matching Do Not Exist
inferred← citeshttps://doi.org/10.1145/297096.297131openalex-snapshot
Greeding matching algorithms, an experimental study
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/3618260.3649725openalex-snapshot
Maximum Bipartite Matching in 𝑛 2+𝑜(1) Time via a Combinatorial Algorithm
inferred← citeshttps://doi.org/10.1145/3696668openalex-snapshot
Maximum Cardinality f -Matching in Time O ( n 2/3 m )
inferred← citeshttps://doi.org/10.1287/ijoc.1060.0178openalex-snapshot
On a Binary-Encoded ILP Coloring Formulation
inferred← citeshttps://doi.org/10.1287/moor.2020.0388openalex-snapshot
A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length
inferred← citeshttps://doi.org/10.1504/ijbra.2008.017161openalex-snapshot
A matrix-based multilevel approach to identify functional protein modules
inferred← citeshttps://doi.org/10.1587/transinf.2016fcp0005openalex-snapshot
An Exact Algorithm for Lowest Edge Dominating Set
inferred← citeshttps://doi.org/10.17877/de290r-15362openalex-snapshot
Searching Randomly for Maximum Matchings
inferred← citeshttps://doi.org/10.25777/e1r5-yp32openalex-snapshot
Algorithms for Vertex-Weighted Matching in Graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1264.94bopenalex-snapshot
On the anti-Kekulé problem of cubic graphs
inferred← citeshttps://doi.org/10.3233/fi-2017-1555openalex-snapshot
The Weighted Matching Approach to Maximum Cardinality Matching
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.54openalex-snapshot
Matching Is as Easy as the Decision Problem, in the NC Model
inferred← citeshttps://doi.org/10.4230/lipics.sea.2017.10openalex-snapshot
A Simplification of the MV Matching Algorithm and its Proof
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0790openalex-snapshot
Scaling algorithms for approximate and exact maximum weight matching
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6705openalex-snapshot
Fast Matrix Rank Algorithms and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1212.5960openalex-snapshot
A Canonical Characterization of the Family of Barriers in General Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06513openalex-snapshot
Online Paintability: The Slow-Coloring Game
inferred← citeshttps://doi.org/10.48550/arxiv.1509.04927openalex-snapshot
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1706.05761openalex-snapshot
Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers
inferred← citeshttps://doi.org/10.48550/arxiv.1710.04376openalex-snapshot
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1711.05398openalex-snapshot
On the anti-Kelulé problem of cubic graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03582openalex-snapshot
A Proof of the MV Matching Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2107.13589openalex-snapshot
Improved quantum error correction using soft information
inferred← citeshttps://doi.org/10.48550/arxiv.math/0304290openalex-snapshot
Maximum Skew-Symmetric Flows and Matchings
inferred← citeshttps://doi.org/10.5121/csit.2023.130310openalex-snapshot
A DFS Algorithm for Maximum Matchings in General Graphs
inferred← citeshttps://doi.org/10.5555/1283383.1283396openalex-snapshot
Maximum matching in graphs with an excluded minor
inferred← citeshttps://doi.org/10.5555/313651.313712openalex-snapshot
Average case analysis of dynamic graph algorithms
inferred← citeshttps://doi.org/10.5555/314161.314264openalex-snapshot
Determinant algorithms for random planar structures
inferred← citeshttps://doi.org/10.5555/314464.314619openalex-snapshot
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
inferred← citeshttps://doi.org/10.70675/28598a09z935cz4b4bz8163z9244bbb8e7feopenalex-snapshot
Parking on random trees
inferred← citeshttps://doi.org/10.7916/d8qf8t2wopenalex-snapshot
Dynamic Algorithms for Shortest Paths and Matching
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.