A flow based pruning scheme for enumerative equitable coloring algorithms

DOI10.1007/s10479-017-2451-1zbMath1406.05033arXiv1607.08754OpenAlexW2475552566MaRDI QIDQ1730611

Robert Scheidweiler, Arie M. C. A. Koster, Martin Tieves

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08754

zbMATH Keywords

equitable chromatic numberflow algorithmsequitable graph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Uses Software

• Boost
• BGL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A DSATUR-based algorithm for the equitable coloring problem
• A fast algorithm for equitable coloring
• On a multiconstrained model for chromatic scheduling
• Restricted coloring models for timetabling
• A polyhedral approach for the equitable coloring problem
• A Tabu Search Heuristic for the Equitable Coloring Problem
• New methods to color the vertices of a graph
• Equitable Coloring
• Perfect Graphs and an Application to Optimizing Municipal Services

This page was built for publication: A flow based pruning scheme for enumerative equitable coloring algorithms