Publication date
January 1998
DOI Publisher
Attuale : EDP Sciences 17, avenue du Hoggar - Parc dActivit\ubfs de Courtaboeuf - BP 112 - F-91944 Les Ulis Cedex A - France precedenti: -Paris: Elsevier 1997-1998 -Dunod Gauthier Villars:15 rue Gossin, 92543 Montrouge France:011 33 1 40926527, 011 33 1 46565266, Fax: 011 33 1 40926597 ISSN
0988-3754 Citation count (estimate)
12Abstract
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
Add to ORKG