scientific article; zbMATH DE number 1033855

DOI<353::AID-RSA5>3.0.CO;2-V 10.1002/(SICI)1098-2418(199705)10:3<353::AID-RSA5>3.0.CO;2-VzbMath0888.05051MaRDI QIDQ4344227

Dan Pritikin, Zevi Miller

Publication date: 1 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

weightsmatchingrandomized greedy algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections ⋮ Greedy matching: guarantees and limitations ⋮ When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time