Optimality of DSatur algorithm on chordal graphs
- 30 September 2024
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 57
Abstract
No abstract availableKeywords
Funding Information
- Secretaría de Ciencia y Técnica, Universidad de Buenos Aires (20020170100495BA, 20020160100095BA)
- Consejo Nacional de Investigaciones Científicas y Técnicas (PIP 11220200100084CO)
- Agencia Nacional de Promoción Científica y Tecnológica (PICT-2021-I-A-00755)
This publication has 8 references indexed in Scilit:
- An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring ProblemNetworks, 2016
- A DSATUR-based algorithm for the Equitable Coloring ProblemComputers & Operations Research, 2015
- A new DSATUR-based algorithm for exact vertex coloringComputers & Operations Research, 2012
- The smallest hard-to-color graph for algorithm DSATURDiscrete Mathematics, 2001
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Chromatic Scheduling and the Chromatic Number ProblemManagement Science, 1972
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961