The BF-graphs form a particular class of Directed hypergraphs. For this important family, different applications are known in data bases and artificial intelligence domain. They may also be used to describe the behaviour of concurrent systems. We present here a theoretical analysis of several hyperpath problems in BF-graphs, with emphasis on the acyclic BF-graphs. After briefly exposing the basic concepts of directed hypergraphs, we present an algorithm for finding a BF-path. We next discuss the problem of finding a hyperpath cover, and present a polynomial solution for two constrained hypepath problems.
展开▼
