Pages that link to "Item:Q5696396"
From MaRDI portal
The following pages link to The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic (Q5696396):
Displayed 4 items.
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)