System Test Planning of Software: An Optimization Approach
IEEE Transactions on Software Engineering
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
The Cost of Learning Directed Cuts
ECML '07 Proceedings of the 18th European conference on Machine Learning
Vertex covering by paths on trees with its applications in machine translation
Information Processing Letters
On structured digraphs and program testing
IEEE Transactions on Computers
One-to-one disjoint path covers on k-ary n-cubes
Theoretical Computer Science
Certifying algorithms for the path cover and related problems on interval graphs
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Mutation based test case generation via a path selection strategy
Information and Software Technology
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
Single-source three-disjoint path covers in cubes of connected graphs
Information Processing Letters
| Hi-index | 0.01 |
In this paper various path cover problems, arising in program testing, are discussed. Dilworth's theorem for acyclic digraphs is generalized. Two methods for fmding a minimum set of paths (minimum path cover) that covers the vertices (or the edges) of a digraph are given. To model interactions among code segments, the notions of required pairs and required paths are introduced. It is shown that rmding a minimum path cover for a set of required pairs is NP-hard. An efficient algorithm is given for findng a minimum path cover for a set of required paths. Other constrained path problems are contsidered and their complexities are discussed.