Pages that link to "Item:Q794430"

The following pages link to Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430):

Displaying 28 items.

• Counting dominating sets and related structures in graphs (Q271644) (← links)
• Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
• Maximizing proper colorings on graphs (Q490999) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Average-case intractability vs. worst-case intractability (Q598182) (← links)
• Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
• Some properties of sets tractable under every polynomial-time computable distribution (Q1350351) (← links)
• No NP problems averaging over ranking of distributions are harder (Q1391309) (← links)
• Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
• Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
• The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
• Counting colorings of a regular graph (Q2345527) (← links)
• A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
• The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
• Some corollaries of a theorem of Whitney on the chromatic polynomial (Q2640610) (← links)
• An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504) (← links)
• (Q3370783) (← links)
• On independent sets in random graphs (Q3452727) (← links)
• A theoretical analysis of backtracking in the graph coloring problem (Q3736910) (← links)
• On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593) (← links)
• Efficient bounds on a branch and bound algorithm for graph colouration (Q4009325) (← links)
• Complexity of Coloring Random Graphs (Q4577957) (← links)
• Extremal graphs for homomorphisms (Q5199417) (← links)
• Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
• An Extremal Property of Turán Graphs, II (Q5417822) (← links)
• Extremal Graphs for Homomorphisms II (Q5418768) (← links)
• The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings (Q6069431) (← links)
• A hard problem that is almost always easy (Q6487965) (← links)