The following pages link to (Q4418675):
Displaying 21 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)
- Coloring in sublinear time (Q826110) (← links)
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
- A note on coloring sparse random graphs (Q1025963) (← links)
- Expose-and-merge exploration and the chromatic number of a random graph (Q1104942) (← links)
- Graphs with small chromatic numbers are easy to color (Q1116349) (← links)
- A randomised heuristical algorithm for estimating the chromatic number of a graph (Q1262784) (← links)
- Expected complexity of graph partitioning problems (Q1346695) (← links)
- Approximating the independence number and the chromatic number in expected polynomial time (Q1598877) (← links)
- Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Approximating the chromatic polynomial (Q2799869) (← links)
- Randomized Δ-edge colouring via exchanges of complex colours (Q2868167) (← links)
- The solution of some random NP-hard problems in polynomial expected time (Q3031922) (← links)
- Short Note: A Las Vegas graph Colouring Algorithm (Q3031923) (← links)
- (Q3370783) (← links)
- Solving NP-hard semirandom graph problems in polynomial expected time (Q3437092) (← links)
- Coloring Clique-free Graphs in Linear Expected Time (Q4019373) (← links)
- Exact and approximative algorithms for coloring G(n,p) (Q4736774) (← links)
- Coloring random graphs (Q5056148) (← links)
