Compact routing tables for graphs of bounded genus (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 351-360

  Gavoille, Cyril ^a   Hanusse, Nicolas ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BIT-OPERATIONS; COMPACT ROUTING TABLES; CROSSING EDGES; DOMINATING SETS; EXTENDED ABSTRACTS; NON-CROSSING PARTITIONS; REPRESENTATION OF GRAPHS; SHORTEST PATH ROUTING;

GRAPH THEORY;

EID: 84862478303     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_32     Document Type: Conference Paper

References (17)

1. [Bil92] T. Bilski, Embedding graphs in books: A survey, IEE Proceedings-E, 139 (1992), pp. 134-138.
2. [BK79] F. Bernhart and P. C. Kainen, The book thickness of a graph, Journal of Combinatorial Theory, 27 (1979), pp. 320-331.
3. [CGH+98] R. C.-N. Chuang, A. Garg, X. He, M.-Y. Kao, and H.-I. Lu, Com- pact encodings of planar graphs via canonical orderings and multiple parentheses, in 25th International Colloquium on Automata, Languages and Programming (ICALP), K. Guldstrand Larsen, S. Skyum, and G. Winskel, eds., vol. 1443 of Lecture Notes in Computer Science, Springer, July 1998, pp. 1-12.
4. [DVW96] A. Denise, M. Vasconcellos, and D. Welsh, The random planar graph, Congressus Numerantium, 113 (1996), pp. 61-79.
5. [EGP98] T. Eilam, C. Gavoille, and D. Peleg, Compact routing schemes with low stretch factor, in 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, ed., August 1998, pp. 11-20.
6. [GH99] C. Gavoille and N. Hanusse, Compact routing tables for graphs of bounded genus, Research Report RR-1213-99, LaBRI, University of Bordeaux, 351, cours de la Libfieration, 33405 Talence Cedex, France, February 1999. To appear in ICALP '99.
7. [GP96] C. Gavoille and S. Perennes, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, ed., May 1996, pp. 125-133.
8. [HI87] L. Heath and S. Istrail, The pagenumber of genus g graphs is O(g), in 19th Annual ACM Symposium on Theory of Computing (STOC), 1987, pp. 388-397.
9. [Jac89] G. Jacobson, Spaceeficient static trees and graphs, in 30th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, October 1989, pp. 549-554.
10. [KRRS94] P. Klein, S. Rao, M. Rauch, and S. Subramanian, Faster shortest-path algorithms for planar graphs, in 26th Annual ACM Symposium on Theory of Computing (STOC), 1994, pp. 27-37.
11. [KW95] K. Keeler and J. Westbrook, Short encodings of planar graphs and maps, Discrete Applied Mathematics, 58 (1995), pp. 239-252.
12. [Mal88] S. M. Malitz, Genus g graphs have pagenumber O( p g), in 29th Symposium on Foundations of Computer Science (FOCS), IEEE, ed., October 1988, pp. 458-468.
13. [MR97] J. I. Munro and V. Raman, Succint representation of balanced parentheses, static trees and planar graphs, in 38rd Symposium on Foundations of Computer Science (FOCS), IEEE, ed., October 1997, pp. 118-126.
14. [PU89] D. Peleg and E. Upfal, A trade-off between space and eficiency for routing tables, Journal of the ACM, 36 (1989), pp. 510-530.
15. [Tur84] G. Turan, Succint representations of graphs, Discrete Applied Mathematics, 8 (1984), pp. 289-294.
16. [Tut62] W. T. Tutte, A census of planar triangulations, Canadian Journal of Mathematics, 14 (1962), pp. 21-38.
17. [Yan86] M. Yannakakis, Four pages are necessary and suficient for planar graphs, in 18th Annual ACM Symposium on Theory of Computing (STOC), 1986, pp. 104-108.