Pages that link to "Item:Q394742"
From MaRDI portal
The following pages link to Average-case complexity of backtrack search for coloring sparse random graphs (Q394742):
Displaying 6 items.
- Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430) (← links)
- Uncertain vertex coloring problem (Q2001167) (← links)
- (Q3370783) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)
- An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900333) (← links)