2 papers
cs.DS2011
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah +2
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…
cs.DM2007
Algorithms for Generating Convex Sets in Acyclic Digraphs
P. Balister, S. Gerke, G. Gutin +5
A set of vertices of an acyclic digraph is convex if and there is no directed path between vertices of which contains a vertex not in . A set i…