Faster algorithms for semi-matching problems (extended abstract)

DOI10.1007/978-3-642-14165-2_16MaRDI QIDQ3587378zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Faster algorithms for semi-matching problems
• On computing an optimal semi-matching
• On computing an optimal semi-matching
• Maximum semi-matching problem in bipartite graphs
• Semi-matchings for bipartite graphs and load balancing

Cited in

(11)

• A faster parameterized algorithm for temporal matching
• On computing an optimal semi-matching
• Faster algorithms for semi-matching problems
• Online collaborative filtering on graphs
• Maximum semi-matching problem in bipartite graphs
• scientific article; zbMATH DE number 6687769 (Why is no real title available?)
• Brief announcement: Distributed approximations for the semi-matching problem
• On computing an optimal semi-matching
• A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
• Semi-matchings for bipartite graphs and load balancing.
• On the distributed complexity of the semi-matching problem

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)