A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
[chapter]
2010
Lecture Notes in Computer Science
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NPhard even if the given graph is bipartite with partition U V , and each vertex in U is assigned the list {1}; this subproblem appears in the context of constraint programming as the consistency problem for the extended global cardinality constraint. We show that this
doi:10.1007/978-3-642-17493-3_16
fatcat:6pop7th6hrebbkwgphlzhn2pau