Author:
Frederickson Greg N.,Janardan Ravi
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference14 articles.
1. A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. G. Chartrand and F. Harary, Planar permutation graphs,Annales de l'Institut Henri Poincaré, Section B3, 1967, pp. 433–438.
3. G. N. Frederickson, Approximation algorithms for some postman problems,Journal of the Association for Computing Machinery, Vol. 26, No. 3, July 1979, pp. 538–554.
4. G. N. Frederickson, Implicit data structures for the dictionary problem,Journal of the Association for Computing Machinery, Vol. 30, No. 1, January 1983, pp. 80–94.
5. G. N. Frederickson and R. Janardan, Optimal message routing without complete routing tables,Proceedings of the 5th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Calgary, August 1986, pp. 88–97.
Cited by
94 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Compact Oblivious Routing;LEIBNIZ INT PR INFOR;2019
2. Interval Routing Schemes for Circular-Arc Graphs;International Journal of Foundations of Computer Science;2017-01
3. On Hierarchical Routing in Doubling Metrics;ACM Transactions on Algorithms;2016-09-02
4. Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time;Graph-Theoretic Concepts in Computer Science;2013
5. Compact policy routing;Distributed Computing;2012-09-18