Ghasemi Nezhad, S., Moghaddas, M. and Panolan, F. orcid.org/0000-0001-6213-8687 (2025) Fast FPT Algorithms for Grundy Number on Dense Graphs. In: Algorithms and Discrete Applied Mathematics 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings. 11th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2025), 13-15 Feb 2025, Coimbatore, Tamilnadu, India. Lecture Notes in Computer Science . Springer , Cham, Switzerland , pp. 160-172. ISBN 978-3-031-83437-0
Abstract
In this paper, we investigate the Grundy Coloring problem for graphs with a cluster modulator, a structure commonly found in dense graphs. The Grundy chromatic number, representing the maximum number of colors needed for the first-fit coloring of a graph in the worstcase vertex ordering, is known to be W[1]-hard when parameterized by the number of colors required by the most adversarial ordering. We focus on fixed-parameter tractable (FPT) algorithms for solving this problem on graph classes characterized by dense substructures, specifically those with a cluster modulator. A cluster modulator is a vertex subset whose removal results in a cluster graph (a disjoint union of cliques). We present FPT algorithms for graphs where the cluster graph consists of one, two, or k cliques, leveraging the cluster modulator’s properties to achieve the best-known FPT runtimes, parameterized by both the modulator’s size and the number of cliques.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This is an author produced version of a proceedings paper published in Algorithms and Discrete Applied Mathematics 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings, made available under the terms of the Creative Commons Attribution License (CC-BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. |
Keywords: | Grundy Coloring, Cluster Graph, Max Flow, Fixed-Parameter Tractable (FPT) Algorithms, Integer Program |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity |
Depositing User: | Symplectic Publications |
Date Deposited: | 03 Jan 2025 14:12 |
Last Modified: | 07 Feb 2025 16:09 |
Published Version: | https://link.springer.com/chapter/10.1007/978-3-03... |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Identification Number: | 10.1007/978-3-031-83438-7_14 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:221125 |