Next Article in Journal
1 Major Component Detection and Analysis (1 MCDA): Foundations in Two Dimensions
Next Article in Special Issue
Computational Study on a PTAS for Planar Dominating Set Problem
Previous Article in Journal / Special Issue
Extracting Co-Occurrence Relations from ZDDs
Open AccessArticle

Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability

1
Department of Computer Systems and Communication, University of Milan-Bicocca, Viale Sarca 336, Milan, Italy
2
Department of Humanities and Social Sciences, University of Bergamo, Via Donizzetti 3, Bergamo, Italy
*
Author to whom correspondence should be addressed.
Algorithms 2013, 6(1), 1-11; https://doi.org/10.3390/a6010001
Received: 31 October 2012 / Revised: 13 December 2012 / Accepted: 18 December 2012 / Published: 27 December 2012
(This article belongs to the Special Issue Graph Algorithms)
The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate the approximation and parameterized complexity of the problem. First, we show that, for any constant ε > 0, the problem is not approximable within factor c1-ε, where c is the number of colors, and that the corresponding decision problem is W[1]-hard when parametrized by the number of disjoint paths. Then, we present a fixed-parameter algorithm for the problem parameterized by the number and the length of the disjoint paths. View Full-Text
Keywords: social networks; disjoint paths; fixed-parameter algorithms; hardness of approximation social networks; disjoint paths; fixed-parameter algorithms; hardness of approximation
Show Figures

Figure 1

MDPI and ACS Style

Bonizzoni, P.; Dondi, R.; Pirola, Y. Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability. Algorithms 2013, 6, 1-11.

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop