Faster algorithms for semi-matching problems (extended abstract)
DOI10.1007/978-3-642-14165-2_16zbMATH Open1287.05148OpenAlexW1605516979MaRDI QIDQ3587378FDOQ3587378
Authors: Jittat Fakcharoenphol, B. Laekhanukit, Danupon Nanongkai 
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_16
Recommendations
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)
Cited In (11)
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
- Online collaborative filtering on graphs
- Faster algorithms for semi-matching problems
- A faster parameterized algorithm for temporal matching
- Semi-matchings for bipartite graphs and load balancing.
- Maximum semi-matching problem in bipartite graphs
- On the distributed complexity of the semi-matching problem
- Brief announcement: Distributed approximations for the semi-matching problem
- On computing an optimal semi-matching
- On computing an optimal semi-matching
- Title not available (Why is that?)
This page was built for publication: Faster algorithms for semi-matching problems (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587378)
