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

Research output: Contribution to journal › Article › peer-review

Access to Document

@article{ff1b57659c3e4653b9e02636cfd94cb1,

title = "Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming",

author = "Gregory Gutin and Kim, \{Eun Jung\} and Arezou Soleimanfallah and Stefan Szeider and Anders Yeo",

year = "2012",

doi = "doi: 10.1007/s00453-011-9548-8",

language = "English",

volume = "doi: 10.1007/s00453-011-9548-8",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

}

TY - JOUR

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

AU - Gutin, Gregory

AU - Kim, Eun Jung

AU - Soleimanfallah, Arezou

AU - Szeider, Stefan

AU - Yeo, Anders

PY - 2012

Y1 - 2012

U2 - doi: 10.1007/s00453-011-9548-8

DO - doi: 10.1007/s00453-011-9548-8

M3 - Article

SN - 0178-4617

VL - doi: 10.1007/s00453-011-9548-8

JO - Algorithmica

JF - Algorithmica

ER -