Hypergraph traversal revisited: Cost measures and dynamic algorithms
Directed hypergraphs are used in several applications to model different combinatorial structures. A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. A hyperpath, similarly to the notion of path in directed graphs, consists of a connection among nodes using hyperarcs. Unlike paths in graphs, however, hyperpaths are suitable of many different definitions of measure, corresponding to different concepts arising in various applications. In this paper we consider the problem of finding optimal hyperpaths according to several measures. We also provide results that may shed some light on the intrinsic complexity of finding optimal hyperpaths.
Unable to display preview. Download preview PDF.
- 1.P. Alimonti, E. Feuerstein, and U. Nanni. Linear time algorithms for liveness and boundedness in conflict-free petri nets. In 1st Latin American Theoretical Informatics, volume 583, pages 1–14. Lecture Notes in Computer Science, Springer-Verlag, 1992.Google Scholar
- 5.G. Ausiello, R. Giaccio, G. F. Italiano, and U. Nanni. Optimal traversal of directed hypergraphs. Manuscript, 1997.Google Scholar
- 10.G. Gallo and G. Rago. A hypergraph approach to logical inference for Datalog formulae. Technical Report 28/90, Dip. di Informatica, Univ. of Pisa, Italy, 1990.Google Scholar
- 11.G. F. Italiano and U. Nanni. On line maintenance of minimal directed hypergraphs. In 3rd Italian Conf. on Theoretical Computer Science, pages 335–349. World Scientific Co., 1989.Google Scholar
- 13.P. B. Miltersen. On-line reevaluation of functions. Technical Report DAIMI PB-380, Comp. Sci. Dept., Aarhus University, January 1992.Google Scholar