Name
Title | ||
|---|---|---|
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). |
Abstract | ||
|---|---|---|
One of the driving problems in the CSP area is the dichotomy conjecture, formulated in 1993 by Feder and Vardi [Monotone monadic SNP and constraint satisfaction, in Proceedings of the 25th Annual Symposium on Theory of Computing, ACM, New York, 1993, pp. 612-622], stating that for any fixed relational structure G the constraint satisfaction problem CSP(G) is either NP-complete or polynomial time solvable. A large amount of research has gone into checking various specific cases of this conjecture. One such variant which attracted a lot of attention in recent years is the LIST MATRIX PARTITION problem. In 2004 Cameron et al. [SIAM J. Discrete Math., 21 (2007), pp. 900-929] classified almost all LIST MATRIX PARTITION variants for matrices of size at most four. The only case which resisted the classification became known as the STUBBORN PROBLEM. In this paper we show a result which enables us to finish the classification-thus solving a problem which resisted attacks for a few years. Our approach is based on a combinatorial problem known to be at least as hard as the STUBBORN PROBLEM-the 3-COMPATIBLE COLORING problem. In this problem we are given a complete graph with each edge assigned one of three possible colors and we want to assign one of those three colors to each vertex in such a way that no edge has the same color as both of its endpoints. The tractability of the 3-COMPATIBLE COLORING problem has been open for several years and the best known algorithm prior to this paper is due to Feder et al. [Two algorithms for general list matrix partitions, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 870-876]-a quasipolynomial algorithm with a n(O(log n/log log n)) time complexity. In this paper we present a polynomial- time algorithm for the 3-Compatible Coloring problem and consequently we prove a dichotomy for the k-COMPATIBLE COLORING problem. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1137/110826813 | SIAM JOURNAL ON COMPUTING |
Keywords | Field | DocType |
3-compatible coloring,stubborn problem,list matrix partition,CSP | Partition problem,Constraint satisfaction,Discrete mathematics,Combinatorics,Matrix (mathematics),Constraint satisfaction problem,Partition (number theory),Time complexity,Conjecture,Monotone polygon,Mathematics | Journal |
Volume | Issue | ISSN |
41 | 4 | 0097-5397 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marek Cygan | 1 | 556 | 40.52 |
| Marcin Pilipczuk | 2 | 436 | 47.86 |
| michal pilipczuk | 3 | 403 | 51.93 |
| jakub onufry wojtaszczyk | 4 | 154 | 9.48 |