Author:
Frigioni Daniele,Marchetti-Spaccamela Alberto,Nanni Umberto
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference30 articles.
1. Network Flows: Theory, Algorithms and Applications;Ahuia,1993
2. Incremental evaluation of computational circuits;Alpern,1990
3. Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey;Arnborg;BIT,1985
4. Incremental algorithms for minimal length paths;Ausiello;J. Algorithms,1991
5. S. Chaudhuri and C. D. Zaroliagis, Shortest path queries in digraphs and small treewidth, inProceedings International Colloquium on Automata Languages and Programming, Szeged, Hungary, July 10–14, 1995, Lecture Notes in Computer Science, Vol. 944, pp. 244–255, Springer-Verlag, Berlin.
Cited by
112 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献