Author:
Alimonti Paola,Leonardi Stefano,Marchetti-Spaccamela Alberto
Subject
Computer Science Applications,General Mathematics,Software
Reference24 articles.
1. 1. AUSIELLO G., ITALIANO G. F., MARCHETTI-SPACCAMELA A. and NANNI U., Incremental algorithms for minimal length paths. J. of Algorithms, 1991, 12, pp. 615-638.11303190751.68042
2. 2. ALIMONTI P., LEONARDI S., MARCHETTI-SPACCAMELA A. and MESSEGUER X., Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs, Proc. 19th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, Springer-Verlag, 1993.0876.680801286265
3. 3. BLUM A., Some tools for approximate 3-coloring, Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990.
4. 4. BOLLOBAS B., Random graphs, Academic Press, 1985.8099960567.05042
5. 5. Dr BATTISTA G. and TAMASSIA R., Incremental planarity testing", Proc. 30th Annual Symp. on Fundations of Computer Science, 1989.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献