An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
On generating all maximal independent sets
Information Processing Letters
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
Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth 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
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
Small Maximal Independent Sets and Faster Exact Graph Coloring
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Measure and conquer: a simple O(20.288n) independent set algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Information Processing Letters
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Improved edge-coloring with three colors
Theoretical Computer Science
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
Recognizing 3-colorings cycle-patterns on graphs
Pattern Recognition Letters
Hi-index | 0.00 |
We consider worst case time bounds for several NP-complete problems, based on a constraint satisfaction (CSP) formulation of these problems: (a, b)-CSP instances consist of a set of variables, each with up to a possible values, and constraints disallowing certain b-tuples of variable values; a problem is solved by assigning values to all variables satisfying all constraints, or by showing that no such assignment exist. 3-SAT is equivalent to (2, 3)-CSP while 3-coloring and various related problems are special cases of (3, 2)-CSP; there is also a natural duality transformation from (a, b)-CSP to (b, a)-CSP. We show that n-variable (3, 2)-CSP instances can be solved in time O(1.3645n), that satisfying assignments to (d, 2)-CSP instances can be found in randomized expected time O((0.4518d)n); that 3-coloring of n-vertex graphs can be solved in time O(1.3289n); that 3-list-coloring of n-vertex graphs can be solved in time O(1.3645n); that 3-edge-coloring of n-vertex graphs can be solved in time O(2n/2), and that 3-satisfiability of a formula with t 3-clauses can be solved in time O(nO(1) + 1.3645t).