Average-case analysis of algorithms for matchings and related problems
From MaRDI portal
Publication:4327634
DOI10.1145/195613.195663zbMath0829.68070OpenAlexW2142702167WikidataQ29037775 ScholiaQ29037775MaRDI QIDQ4327634
Publication date: 10 April 1995
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195613.195663
Related Items
Maximum likelihood analysis of the Ford-Fulkerson method on special graphs ⋮ Balanced allocation and dictionaries with tightly packed constant size bins ⋮ The Metropolis algorithm for graph bisection ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ Packing vertices and edges in random regular graphs ⋮ Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Output sensitive fault tolerant maximum matching ⋮ Approximate congruence in nearly linear time
