Pages that link to "Item:Q1079363"
From MaRDI portal
The following pages link to The complexity of colouring problems on dense graphs (Q1079363):
Displayed 9 items.
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- A randomised 3-colouring algorithm (Q1117242) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (Q4314146) (← links)
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case (Q4845083) (← links)