Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
暂无分享,去创建一个
Daniele Frigioni | Giorgio Ausiello | Paolo Giulio Franciosa | P. G. Franciosa | G. Ausiello | D. Frigioni
[1] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[2] J. Dekleer. An assumption-based TMS , 1986 .
[3] Alberto Martelli,et al. Additive AND/OR Graphs , 1973, IJCAI.
[4] Giorgio Ausiello,et al. Dynamic Maintenance of Directed Hypergraphs , 1990, Theor. Comput. Sci..
[5] Maria Grazia Scutellà,et al. Flows on hypergraphs , 1997, Math. Program..
[6] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[7] Kurt Konolige,et al. Abductive theories in artificial intelligence , 1997 .
[8] Roberto Giaccio,et al. On-Line Algorithms for Satisfiability Problems with Uncertainty , 1994, Theor. Comput. Sci..
[9] Scott A. Smolka,et al. Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract) , 1998, ICALP.
[10] S. Pallottino,et al. Hyperpaths and shortest hyperpaths , 1989 .
[11] David Maier,et al. Connections in acyclic hypergraphs: extended abstract , 1982, PODS '82.
[12] Henrik Reif Andersen. Model Checking and Boolean Graphs , 1992, ESOP.
[13] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[14] Donald E. Knuth,et al. A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..
[15] SarkarSumit,et al. Using Directed Hypergraphs to Verify Rule-Based Expert Systems , 1997 .
[16] Giuseppe F. Italiano,et al. Online Maintenance of Minimal Directed Hypergraphs , 1989 .
[17] Maria Grazia Scutellà,et al. Directed hypergraphs as a modelling paradigm , 1999 .
[18] Nils J. Nilsson,et al. Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.
[19] Harold Boley. Directed Recursive Labelnode Hypergraphs: A New Representation-Language , 1977, Artif. Intell..
[20] Claude Berge,et al. Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.
[21] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[22] Jeremy G. Siek,et al. The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.
[23] Hsu-Chun Yen,et al. A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..
[24] Claudio Gentile,et al. Max Horn SAT and the minimum cut problem in directed hypergraphs , 1998, Math. Program..
[25] Johan de Kleer,et al. An Assumption-Based TMS , 1987, Artif. Intell..
[26] Giorgio Ausiello. Directed Hypergraphs: Data Structures and Applications , 1988, CAAP.
[27] Carlos Alonso González,et al. On Line Industrial Diagnosis: An Attempt to Apply Artificial Intelligence Techniques to Process Control , 1998, IEA/AIE.
[28] Julián Aráoz. Forward chaining is simple(x) , 2000, Oper. Res. Lett..
[29] Sitharama S. Iyengar,et al. Efficient parallel algorithms for functional dependency manipulations , 1990, DPDS '90.
[30] S. Pallottino,et al. Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .
[31] J. D. Uiiman,et al. Principles of Database Systems , 2004, PODS 2004.
[32] Daniele Pretolani,et al. A directed hypergraph model for random time dependent shortest paths , 2000, Eur. J. Oper. Res..
[33] Alberto Martelli,et al. Dynamic Programming as Graph Searching: An Algebraic Approach , 1981, JACM.
[34] Giuseppe F. Italiano,et al. Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms , 1998, MFCS.
[35] Giorgio Ausiello,et al. Graph Algorithms for Functional Dependency Manipulation , 1983, JACM.
[36] Umberto Nanni,et al. Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets , 1992, LATIN.
[37] W. W. Bledsoe,et al. Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.
[38] G. Italiano,et al. Optimal Traversal of Directed Hypergraphs , 1992 .
[39] Giorgio Gallo,et al. Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..
[40] David Maier,et al. Connections in Acyclic Hypergraphs , 1984, Theor. Comput. Sci..
[41] Giuseppe F. Italiano,et al. On-Line Algorithms for Polynomially Solvable Satisfiability Problems , 1991, J. Log. Program..
[42] Giorgio Ausiello,et al. Minimal Representation of Directed Hypergraphs , 1986, SIAM J. Comput..
[43] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .