Hypergraph traversal revisited: Cost measures and dynamic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 1-16

  Ausiello, Giorgio ^a   Italiano, Giuseppe F ^b   Nanni, Umberto ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ALGORITHMS; DIRECTED GRAPHS;

COMBINATORIAL STRUCTURES; DIRECTED HYPERGRAPHS; DYNAMIC ALGORITHM; HYPERGRAPH; HYPERPATH; SOURCE NODES; TARGET NODES;

DIRECTED GRAPHS; GRAPH THEORY;

EID: 84896694167     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055754     Document Type: Conference Paper

References (15)

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.
2. G. Ausiello, A. D'Atri, and D. Saccà. Graph algorithms for functional dependency manipulation. Journal of the ACM, 30:752-766, 1983.
3. G. Ausiello, A. D'Atri, and D. Saccà. Minimal representation of directed hyper-graphs. SIAM Journal on Computing, 15:418-431, 1986.
4. G. Ausiello, R. Giaccio. On-line algorithms for satisfiability formulae with uncertainty. Theoretical Computer Science 171:3-24, 1997.
5. G. Ausiello, R. Giaccio, G. F. Italiano, and U. Nanni. Optimal traversal of directed hypergraphs. Manuscript, 1997.
6. G. Ausiello and G. F. Italiano. Online algorithms for polynomially solvable satisfiability problems. Journal of Logic Programming, 10:69-90, 1991.
7. G. Ausiello, G. F. Italiano, and U. Nanni. Dynamic maintenance of directed hypergraphs. Theoretical Computer Science, 72(2-3):97-117, 1990.
8. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
9. G. Gallo, G. Longo, S. Nguyen, and S. Pallottino. Directed hypergraphs and applications. Discrete Applied Mathematics 42 (1993) 177-201.
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.
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.
12. D. E. Knuth. A generalization of Dijkstra's algorithm. Information Processing Letters, 6(1):1-5, 1977.
13. P. B. Miltersen. On-line reevaluation of functions. Technical Report DAIMI PB-380, Comp. Sci. Dept., Aarhus University, January 1992.
14. S. Nguyen and S. Pallottino. Hyperpaths and shortest hyperpaths. Combinatorial Optimization, 1403:258-271, 1989.
15. G. Ramalingam and T. Reps, An Incremental Algorithm for a Generalization of the Shortest Path Problem, Journal of Algorithms, 21:267-305, 1996.