Abstract
This paper concerns routing with succinct tables in chordal graphs. We show how to construct in polynomial time, for every n-node chordal graph, a routing scheme using routing tables and addresses of O(log3 n/ log log n) bits per node, and O(log2 n/ log log n) bit not alterable headers such that the length of the route between anyt wo nodes is at most the distance between the nodes in the graph plus two.
Author supplied keywords
Cite
CITATION STYLE
Dourisboure, Y., & Gavoille, C. (2002). Improved compact routing scheme for chordal graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2508, pp. 252–264). Springer Verlag. https://doi.org/10.1007/3-540-36108-1_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
