Pages that link to "Item:Q3736910"

The following pages link to A theoretical analysis of backtracking in the graph coloring problem (Q3736910):

Displaying 22 items.

• Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
• Maximizing proper colorings on graphs (Q490999) (← links)
• Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
• Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430) (← links)
• A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479) (← links)
• Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
• Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
• Multi-scale process modelling and distributed computation for spatial data (Q2209724) (← 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)
• Using an incomplete version of dynamic backtracking for graph colouring (Q2741266) (← links)
• Short Note: A Las Vegas graph Colouring Algorithm (Q3031923) (← links)
• (Q3370783) (← 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)
• An Extremal Property of Turán Graphs, II (Q5417822) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900333) (← links)
• The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings (Q6069431) (← links)