Pages that link to "Item:Q4736774"
From MaRDI portal
The following pages link to Exact and approximative algorithms for coloring G(n,p) (Q4736774):
Displaying 5 items.
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- On-line list colouring of random graphs (Q491533) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
- A note on coloring sparse random graphs (Q1025963) (← links)
