Maximum matching on trees in the online preemptive and the incremental dynamic graph models
From MaRDI portal
Publication:2412432
DOI10.1007/978-3-319-62389-4_42zbMath1434.68371arXiv1612.05419OpenAlexW2581117008MaRDI QIDQ2412432
Sumedh Tirodkar, Sundar Vishwanathan
Publication date: 23 October 2017
Full work available at URL: https://arxiv.org/abs/1612.05419
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Online algorithms for maximum cardinality matching with edge arrivals, Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
