Pages that link to "Item:Q5900333"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900333):
Displaying 6 items.
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430) (← links)
- Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- (Q3370783) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)