Path cover

From Wikipedia, the free encyclopedia

You have new messages (last change).

Given a directed graph G = (V,E), a vertex-disjoint path cover is a set of vertex-disjoint directed paths such that every vertex v \in V belongs to exactly one path. Note that a path cover may include paths of length 0 (a single vertex).

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../p/a/t/Path_cover.html"