Publication:2934589
From MaRDI portal
zbMath1302.05195MaRDI QIDQ2934589
Publication date: 18 December 2014
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)
05C40: Connectivity
Related Items
Unnamed Item, Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching, Unnamed Item, Dynamic Approximate Vertex Cover and Maximum Matching, NC Algorithms for Weighted Planar Perfect Matching and Related Problems, Fully Dynamic Maximal Matching in $O(\log n)$ Update Time, Approximating multistage matching problems, Approximating multistage matching problems, Dynamic Matching Algorithms in Practice, Fast primal-dual update against local weight update in linear assignment problem and its application, Dynamic matrix rank, Fast dynamic transitive closure with lookahead, Shortest augmenting paths for online matchings on trees, Dynamic matrix rank with partial lookahead, Deterministic dynamic matching in \(O(1)\) update time, Shortest Augmenting Paths for Online Matchings on Trees, Fully Dynamic Matching in Bipartite Graphs, Reachability is in DynFO, Elastic Geometric Shape Matching for Point Sets under Translations