scientific article
From MaRDI portal
Publication:2934589
zbMath1302.05195MaRDI QIDQ2934589
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (20)
Fully Dynamic Matching in Bipartite Graphs ⋮ Reachability is in DynFO ⋮ Elastic Geometric Shape Matching for Point Sets under Translations ⋮ Dynamic matrix rank ⋮ Fast dynamic transitive closure with lookahead ⋮ Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching ⋮ NC Algorithms for Weighted Planar Perfect Matching and Related Problems ⋮ Deterministic dynamic matching in worst-case update time ⋮ Fast primal-dual update against local weight update in linear assignment problem and its application ⋮ Unnamed Item ⋮ Dynamic Matching Algorithms in Practice ⋮ Shortest augmenting paths for online matchings on trees ⋮ Dynamic matrix rank with partial lookahead ⋮ Dynamic Approximate Vertex Cover and Maximum Matching ⋮ Shortest Augmenting Paths for Online Matchings on Trees ⋮ Approximating multistage matching problems ⋮ Approximating multistage matching problems ⋮ Deterministic dynamic matching in \(O(1)\) update time ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time ⋮ Unnamed Item
This page was built for publication:
