Pages that link to "Item:Q3988828"
From MaRDI portal
The following pages link to The greedy coloring is a bad probabilistic algorithm (Q3988828):
Displaying 11 items.
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
- Qos-aware service evaluation and selection (Q932236) (← links)
- Expected complexity of graph partitioning problems (Q1346695) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Performance ratio of the generalized greedy algorithm for \(q\)-coloring problem (Q2826435) (← links)
- A Coloring Problem (Q3983387) (← links)
- A passage time for greedy‐coloring cycles (Q4322478) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- Hard graphs for randomized subgraph exclusion algorithms (Q5054768) (← links)