Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Efficient Communication Schemes
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Small k-Dominating Sets in Planar Graphs with Applications
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Compact routing schemes with low stretch factor
Journal of Algorithms
The compactness of adaptive routing tables
Journal of Discrete Algorithms
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
Discrete Applied Mathematics
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
(Nearly-)tight bounds on the contiguity and linearity of cographs
Theoretical Computer Science
| Hi-index | 0.00 |
The compactness of a graph measures the space complexity of its shortest path routing tables. Each outgoing edge of a node x is assigned a (pairwise disjoint) set of addresses, such that the unique outgoing edge containing the address of a node y is the first edge of a shortest path from x to y. The complexity measure used in the context of interval routing is the minimum number of intervals of consecutive addresses needed to represent each such set, minimized over all possible choices of addresses and all choices of shortest paths. This paper establishes asymptotically tight bounds of n/4 on the compactness of an n-node graph. More specifically, it is shown that every n-node graph has compactness at most n/4+o(n), and conversely, there exists an n-node graph whose compactness is n/4 - o(n). Both bounds improve upon known results. (A preliminary version of the lower bound has been partially published in Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 1300, pp. 259--268, 1997.)