A randomised 3-colouring algorithm
Discrete Mathematics - Graph colouring and variations
An Õ(n3/14)-coloring algorithm for 3-colorable graphs
Information Processing Letters
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Deciding 3-Colourability in Less Than O(1.415^n) Steps
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Solving 3-Satisfiability in Less Then 1, 579n Steps
CSL '92 Selected Papers from the Workshop on Computer Science Logic
A New Approach on Solving 3-Satisfiability
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
3-coloring in time 0(1.3446^n): a no-MIS algorithm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Systematic Generation of Very Hard Cases for Graph 3-Colorability
TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for k-colouring and finding maximal independent sets
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Finite Domain Constraint Satisfaction Using Quantum Computation
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
Determining the Number of Solutions to Binary CSP Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science - Algorithmic combinatorial game theory
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Journal of Algorithms
Computing in Science and Engineering
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
Constructive generation of very hard 3-colorability instances
Discrete Applied Mathematics
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
Load-oriented and interference-aware channel assignment for multicasting in wireless mesh networks
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
3-coloring in time O (1.3289n)
Journal of Algorithms
An O*(1.0977n) exact algorithm for MAX INDEPENDENT SET in sparse graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Solving NP-complete problems with quantum search
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
Colorings with few colors: counting, enumeration and combinatorial bounds
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Discrete Applied Mathematics
On the partition of 3-colorable graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Exact computation of maximum induced forest
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computing optimal solutions for the MIN 3-SET COVERING problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Faster exact solving of SAT formulae with a low number of occurrences per variable
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Locally consistent constraint satisfaction problems with binary constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Partitioning based algorithms for some colouring problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
A CSP search algorithm with reduced branching factor
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Complexity analysis of heuristic CSP search algorithms
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Algorithms for the maximum hamming distance problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
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
Improved worst-case complexity for the MIN 3-SET COVERING problem
Operations Research Letters
Enumerating maximal independent sets with applications to graph colouring
Operations Research Letters
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 0.01 |
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems; 3-SAT is equivalent to (2, 3)-CSP while the other problems above are special cases of (3, 2)-CSP. We give a fast algorithm for (3, 2)-CSP and use it to improve the time bounds for solving the other problems listed above. Our techniques involve a mixture of Davis-Putnam-style backtracking with more sophisticated matching and network flow based ideas.