37 citations · 65 across the 16 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
Finding Disjoint Paths on Edge-Colored Graphs: More Tractability Results
Riccardo Dondi, Florian Sikora
The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by appli…
cs.DS2016★ 4 cited
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
Riccardo Dondi, Florian Sikora
The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last…