#### Filter Results:

#### Publication Year

1977

2009

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A point-disjoint path cover of a directed graph is a collection of point-disjoint paths (some paths possibly having zero length) which covers all the points. A path cover which minimizes the number of paths corresponds to an optimal sequence of the steps of a computer program for efficient coding and documentation. The minimization problem for the general… (More)