Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
暂无分享,去创建一个
[1] Giuseppe F. Italiano,et al. Online Maintenance of Minimal Directed Hypergraphs , 1989 .
[2] Donald E. Knuth,et al. A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..
[3] Giorgio Ausiello,et al. Minimal Representation of Directed Hypergraphs , 1986, SIAM J. Comput..
[4] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[5] Giorgio Gallo,et al. Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..
[6] S. Pallottino,et al. Hyperpaths and shortest hyperpaths , 1989 .
[7] Giorgio Ausiello,et al. On-Line Algorithms for Satisfiability Problems with Uncertainty , 1997, Theor. Comput. Sci..
[8] Giorgio Ausiello,et al. Graph Algorithms for Functional Dependency Manipulation , 1983, JACM.
[9] Umberto Nanni,et al. Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets , 1992, LATIN.
[10] G. Italiano,et al. Optimal Traversal of Directed Hypergraphs , 1992 .
[11] Giorgio Ausiello,et al. Dynamic Maintenance of Directed Hypergraphs , 1990, Theor. Comput. Sci..
[12] Giuseppe F. Italiano,et al. On-Line Algorithms for Polynomially Solvable Satisfiability Problems , 1991, J. Log. Program..
[13] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[14] Peter Bro Miltersen. On-Line Reevaluation of Functions , 1992 .