Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419705 | Discrete Applied Mathematics | 2009 | 11 Pages |
Abstract
A Directed Path Family is a family of subsets of some finite ground set whose members can be realized as arc sets of simple directed paths in some directed graph. In this paper we show that recognizing whether a given family is a Directed Path family is an NP-Complete problem, even when all members in the family have at most two elements. If instead of a family of subsets, we are given a collection of words from some finite alphabet, then deciding whether there exists a directed graph GG such that each word in the language is the set of arcs of some path in GG, is a polynomial-time solvable problem.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
N. Apollonio, P.G. Franciosa,