Encyclopedia > P > Path cover
Path cover
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).
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)