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 13 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)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- A note on coloring sparse random graphs (Q1025963) (← links)
- Approximating the independence number and the chromatic number in expected polynomial time (Q1598877) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- A spectral technique for coloring random 3-colorable graphs (preliminary version) (Q2817627) (← links)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← links)
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)
- Worst-case time bounds for coloring and satisfiability problems (Q4806606) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)
