Fast FPT Algorithms for Grundy Number on Dense Graphs

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

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:
  • Published: 5 February 2025
  • Published (online): 5 February 2025
  • Accepted: 12 November 2024
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):

Download

Export

Statistics