Directed paths on a tree: coloring, multicut and kernel

Details Directed paths on a tree: coloring, multicut and kernel Directed paths on a tree: coloring, multicut and kernel

2009-02-06

arxiv.org/abs/0902.1182v1

Computer Science

Discrete Mathematics

Scientific paper

In the present paper, we study algorithmic questions for the arc-intersection graph of directed paths on a tree. Such graphs are known to be perfect (proved by Monma and Wei in 1986). We present faster algorithms than all previously known algorithms for solving the minimum coloring and the minimum clique cover problems. They both run in $O(np)$ time, where $n$ is the number of vertices of the tree and $p$ the number of paths. Another result is a polynomial algorithm computing a kernel in the intersection graph, when its edges are oriented in a clique-acyclic way. Indeed, such a kernel exists for any perfect graph by a theorem of Boros and Gurvich. Such algorithms computing kernels are known only for few classes of perfect graphs.

Affiliated with

Also associated with

No associations

Rating

Directed paths on a tree: coloring, multicut and kernel 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 Directed paths on a tree: coloring, multicut and kernel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directed paths on a tree: coloring, multicut and kernel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-311685