arXiv Open Access 2013

Greedy Graph Colouring is a Misleading Heuristic

Ciaran McCreesh Patrick Prosser

Lihat Sumber

Abstrak

State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and bound.

Topik & Kata Kunci

cs.DS

Penulis (2)

Ciaran McCreesh

Patrick Prosser

Format Sitasi

APA MLA BibTeX

McCreesh, C., Prosser, P. (2013). Greedy Graph Colouring is a Misleading Heuristic. https://arxiv.org/abs/1310.7741

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓