Maximum Colorful Cycles in Vertex-Colored Graphs

Abstract : In this paper, we study the problem of finding a maximum colorful cycle a vertex-colored graph. Specifically, given a graph with colored vertices, the goal is to find a cycle containing the maximum number of colors. We aim to give a dichotomy overview on the complexity of the problem. We first show that the problem is NP-hard even for simple graphs such as split graphs, biconnected graphs, interval graphs. Then we provide polynomial-time algorithms for classes of vertex-colored threshold graphs and vertex-colored bipartite chain graphs, which are our main contributions.
Type de document :
Communication dans un congrès
CSR 2018 - 13th International Computer Science Symposium in Russia, Jun 2018, Moscow, Russia. Springer, CSR 2018: Computer Science – Theory and Applications, 10846, pp.106-117, Lecture Notes in Computer Science. 〈10.1007/978-3-319-90530-3_10〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01762581
Contributeur : Yannis Manoussakis <>
Soumis le : mardi 10 avril 2018 - 11:32:26
Dernière modification le : mercredi 23 janvier 2019 - 13:48:04

Identifiants

Citation

Giuseppe Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong-Phong Pham. Maximum Colorful Cycles in Vertex-Colored Graphs. CSR 2018 - 13th International Computer Science Symposium in Russia, Jun 2018, Moscow, Russia. Springer, CSR 2018: Computer Science – Theory and Applications, 10846, pp.106-117, Lecture Notes in Computer Science. 〈10.1007/978-3-319-90530-3_10〉. 〈hal-01762581〉

Partager

Métriques

Consultations de la notice

219