Pages that link to "Item:Q5920158"
From MaRDI portal
The following pages link to Faster graph coloring in polynomial space (Q5920158):
Displaying 9 items.
- Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- Small Maximal Independent Sets and Faster Exact Graph Coloring (Q4435347) (← links)
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)
- Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)