The BF-graphs form a particular class of directed hypergraphs. For this important family, several applications are known in data bases and in the artificial intelligence domain. These hypergraphs may also be used to describe the behaviour of concurrent systems. We present here a theoretical analysis of several hyperpath problems for BF-graphs, with emphasis on the acyclic BF-graphs. After briefly explaining 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 hyperpath problems.
On some path problems on oriented hypergraphs / S., Nguyen; Pretolani, Daniele; L., Markenzon. - In: RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS. - ISSN 0988-3754. - STAMPA. - 32 (1-3):(1998), pp. 1-20.