The maximum disjoint paths problem on multi-relations social networks

Details The maximum disjoint paths problem on multi-relations social networks The maximum disjoint paths problem on multi-relations social networks

2011-04-22

arxiv.org/abs/1104.4370v1

Computer Science

Data Structures and Algorithms

Scientific paper

10.1016/j.disopt.2012.01.002

Motivated by applications to social network analysis (SNA), we study the problem of finding the maximum number of disjoint uni-color paths in an edge-colored graph. We show the NP-hardness and the approximability of the problem, and both approximation and exact algorithms are proposed. Since short paths are much more significant in SNA, we also study the length-bounded version of the problem, in which the lengths of paths are required to be upper bounded by a fixed integer $l$. It is shown that the problem can be solved in polynomial time for $l=3$ and is NP-hard for $l\geq 4$. We also show that the problem can be approximated with ratio $(l-1)/2+\epsilon$ in polynomial time for any $\epsilon >0$. Particularly, for $l=4$, we develop an efficient 2-approximation algorithm.

Affiliated with

Also associated with

No associations

Rating

The maximum disjoint paths problem on multi-relations social networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The maximum disjoint paths problem on multi-relations social networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The maximum disjoint paths problem on multi-relations social networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330084