Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

122

Voted

IWPEC
2010
Springer

210views Applied Computing» more IWPEC 2010»

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

15 years 19 days ago

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

Download www.kr.tuwien.ac.at

Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah

Real-time Traffic

Applied Computing | IWPEC 2010 |

claim paper

Related Content

» Exact Bipartite Crossing Minimization under Tree Constraints

» Consistent bipartite graph copartitioning for starstructured highorder heterogeneous data ...

» Constraint Satisfaction with Bounded Treewidth Revisited

» A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

» ConstraintBased Optimal Testing Using DNNF Graphs

» The minimum consistent subset cover problem and its applications in data mining

» From ML to MLF graphic type constraints with efficient type inference

» Eliminating graphs by means of parallel knockout schemes

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	IWPEC
Authors	Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo

Comments (0)