Tropical paths in vertex-colored graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Tropical paths in vertex-colored graphs

Abstract

A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the initial graph. In this work we study the problem of finding tropical paths in vertex-colored graphs. There are two versions for this problem: the shortest tropical path problem (STPP) and the tropical path problem (TPP). We show that two problem versions are NP-hard for DAG graphs, cactus graphs and interval graphs. Moreover, we also provides a dynamic programming algorithm for STPP and prove polynomial algorithms for TPP for some specific graphs including trees, block graphs bipartite chain graphs and threshold graphs. Throughout the paper we left some open questions.
Not file

Dates and versions

hal-01635425 , version 1 (15-11-2017)

Identifiers

Cite

Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Phong E Pham, et al.. Tropical paths in vertex-colored graphs. COCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shangai, China. pp.291-305, ⟨10.1007/978-3-319-71147-8_20⟩. ⟨hal-01635425⟩
285 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More