Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Frozen development in graph coloring
Theoretical Computer Science - Phase transitions in combinatorial problems
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
An Optimal Lower Bound for Resolution with 2-Conjunctions
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Small Maximal Independent Sets and Faster Exact Graph Coloring
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Colouring Random Graphs in Expected Polynomial Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Journal of Algorithms
The resolution complexity of random graphk-colorability
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
The resolution complexity of random graph k-colorability
Discrete Applied Mathematics
3-coloring in time O (1.3289n)
Journal of Algorithms
Guided search and a faster deterministic algorithm for 3-SAT
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Dominating set based exact algorithms for 3-coloring
Information Processing Letters
On the partition of 3-colorable graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We consider worst case time bounds for NP-complete problems including 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a common generalization of these problems, called symbol-system satisfiability or, briefly, SSS. 3-SAT is equivalent to (2,3)-SSS while the other problems above are special cases of (3,2)-SSS; there is also a natural duality transformation from (a,b)-SSS to (b,a)-SSS. We give a fast algorithm for (3,2)-SSS and use it to improve the time bounds for solving the other problems listed above.