Author:
Alimonti Paola,Feuerstein Esteban
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. P. Alimonti, E. Feuerstein, U. Nanni, Linear time algorithms for Liveness and Boundedness in Conflict-free Petri nets, Proc. of 1st Latin American Symposium on Theoretical Informatics, LNCS 583, Springer-Verlag (1992).
2. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
3. G. Ausiello, A. D'Atri, D. Saccá, Graph algorithms for functional dependency manipulation, J. ACM, 30 (1983), 752–766.
4. G. Ausiello, G.F. Italiano, and U. Nanni, Dynamic Maintenance of Directed Hypergraphs Theoretical Computer Science 72, 2–3 (1990), 97–117.
5. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam (1973).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献