Maximum Colorful Cycles in Vertex-Colored Graphs - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Conference Papers Year : 2018

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.
No file

Dates and versions

hal-01762581 , version 1 (10-04-2018)

Identifiers

Cite

Giuseppe F 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. pp.106-117, ⟨10.1007/978-3-319-90530-3_10⟩. ⟨hal-01762581⟩
186 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More