Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676)
From MaRDI portal
scientific article; zbMATH DE number 5823288
- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming |
scientific article; zbMATH DE number 5823288 |
|
Statements
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (English)
0 references
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming (English)
0 references
21 November 2012
0 references
7 December 2010
0 references
general factor
0 references
global constraint
0 references
fixed-parameter tractable
0 references
