Shortest $$(A+B)$$(A+B)-Path Packing Via Hafnian
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0334-0
Abstract: Björklund and Husfeldt developed a randomized polynomial time algorithm to solve the shortest two disjoint paths problem. Their algorithm is based on computation of permanents modulo 4 and the isolation lemma. In this paper, we… read more here.
Keywords: disjoint paths; two disjoint; path packing; path ... See more keywords
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00772-w
Abstract: This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths… read more here.
Keywords: disjoint paths; edge disjoint; edge; cut ... See more keywords
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
The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Access"
DOI: 10.1109/access.2021.3080931
Abstract: The multipath challenge is a research line in continuous development because of its multiple benefits, however, these benefits are overshadowed by scalability, which goes down considerably when the paths are multiple and disjoint. The disjointness… read more here.
Keywords: disjoint paths; scalability; multiple disjoint; disjoint ... See more keywords