Abstract
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 behavior 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 presesnt 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.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call