Optimal General Matchings

This publication has 20 references indexed in Scilit:

• Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors
  2013
• Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
  Algorithmica, 2011
• The College Admissions problem with lower and common quotas
  Theoretical Computer Science, 2010
• A 12-integral relaxation for the A-matching problem
  Operations Research Letters, 2006
• hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care
  2003
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
  Journal of Algorithms, 1993
• General factors of graphs
  Journal of Combinatorial Theory, Series B, 1988
• A polynomial algorithm for b-matchings: An alternative approach
  Information Processing Letters, 1987
• [a,b]‐factorization of a graph
  Journal of Graph Theory, 1985
• An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems
  1983