scientific article; zbMATH DE number 5305148

MaRDI QIDQ3515552zbMATHFDO

Authors Sriyankar Acharyya

Publication date 29 July 2008

zbMATH Keywords

satisfiability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Another look at graph coloring via propositional satisfiability
• Algorithms for Counting 2-Sat Solutions and Colorings with Applications
• On the complexity of the selective graph coloring problem in some special classes of graphs
• The complexity of some graph colouring problems
• Cliques, colouring and satisfiability: from structure to algorithms
• scientific article; zbMATH DE number 1982173
• Constraint and satisfiability reasoning for graph coloring
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring
• Some results concerning the complexity of restricted colorings of graphs
• From graph coloring to constraint satisfaction: there and back again

Cited in

(4)

• Theory and Applications of Satisfiability Testing
• FWLS: a local search for graph coloring
• A study of heuristic guesses for adiabatic quantum computation
• Another look at graph coloring via propositional satisfiability

Describes a project that uses

Uses Software

• Walksat

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515552)