On Computing an Optimal Semi-matching
From MaRDI portal
Publication:3104781
DOI10.1007/978-3-642-25870-1_23zbMath1341.05207OpenAlexW1530086068MaRDI QIDQ3104781
František Galčík, Gabriel Semanisin, Ján Katrenič
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_23
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)
Related Items
Deadlock resolution in wait-for graphs by vertex/arc deletion, Distributed backup placement in networks, On the distributed complexity of the semi-matching problem
Cites Work
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
- Faster Algorithms for Semi-matching Problems (Extended Abstract)
- Scheduling independent tasks to reduce mean finishing time
- Algorithms – ESA 2004
- Semi-matchings for bipartite graphs and load balancing
- Technical Note—Minimizing Average Flow Time with Parallel Machines