Finding disjoint paths on edge-colored graphs: more tractability results
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0238-6
Abstract: 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 applications in social network analysis. In this paper we investigate… read more here.
Keywords: disjoint paths; disjoint; finding disjoint; problem ... See more keywords