Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
January 2012
bib DOI

Abstract

Full Citation:

Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica, volume 64, number 1, pages 112-125, 2012.

Type
Journal Article
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.