Publication:4962204: Difference between revisions
From MaRDI portal
Publication:4962204
Created automatically from import240305080351 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Simple Deterministic Algorithms for Fully Dynamic Maximal Matching to Simple Deterministic Algorithms for Fully Dynamic Maximal Matching: Duplicate |
(No difference)
| |
Latest revision as of 16:09, 2 May 2024
DOI10.1145/2700206zbMath1400.05241arXiv1207.1277MaRDI QIDQ4962204
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.1277
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
