Simple deterministic algorithms for fully dynamic maximal matching

DOI10.1145/2700206MaRDI QIDQ6829644zbMATH OpenFDO

Authors Ofer Neiman, Shay Solomon

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

zbMATH Keywords

maximum matchingdynamic algorithmsmaximal matching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Simple deterministic algorithms for fully dynamic maximal matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829644)