The Maximum Clique and Vertex Coloring

Oleksandra Yezerska () and Sergiy Butenko ()
Additional contact information
Oleksandra Yezerska: Texas A&M University, Department of Industrial and Systems Engineering
Sergiy Butenko: Texas A&M University, Department of Industrial and Systems Engineering

Chapter 57 in Handbook of Heuristics, 2025, pp 1715-1746 from Springer

Abstract: Abstract In this chapter, we review heuristic approaches for two classical and closely related problems of finding a maximum clique and an optimal vertex coloring. Both problems have a wide variety of practical applications, and due to their computational intractability, a significant effort has been focused on developing heuristic methods. This chapter discusses construction heuristics, local search strategies, and metaheuristics designed and/or adapted for the maximum clique and vertex coloring problems.

Keywords: Maximum clique; Vertex coloring; Chromatic number (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-032-00385-0_47

Ordering information: This item can be ordered from
http://www.springer.com/9783032003850

DOI: 10.1007/978-3-032-00385-0_47

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().