Compact forbidden-set routing

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

Volumn 4393 LNCS, Issue , 2007, Pages 37-48

  Courcelle, Bruno ^a   Twigg, Andrew ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Algorithms; Compact routing; Labelling schemes

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTERNET; NETWORK ROUTING; PROBLEM SOLVING;

COMPACT ROUTING; INTERNET ROUTING; LABELLING SCHEMES;

SOFTWARE ARCHITECTURE;

EID: 38049139049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_4     Document Type: Conference Paper

References (15)

1. Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, New York, NY, USA, ACM Press (2001) 1-10
2. Varadhan, K., Govindan, R., Estrin, D.: Persistent route oscillations in interdomain routing. Technical report, USC/ISI (1996)
3. Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10 (2002) 232-243
4. Feigenbaum, J., Karger, D., Mirrokni, V., Sami, R.: Subjective-cost policy routing. In: Lecture Notes in Computer Science. Volume 3828. (2005) 174-183
5. Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique-width. Discrete Applied Mathematics 131 (2003) 129-150
6. Gupta, A., Kumar, A., Thorup, M.: Tree based mpls routing. In: SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, New York, NY, USA, ACM Press (2003) 193-199
7. Courcelle, B. In: Graph decompositions. (2006) Chapter of a book in preparation. Available at www.labri.fr/perso/courcell/Textes/ChapitreDecArbos. pdf.
8. Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. J. ACM 40 (1993) 1134-1164
9. Bodlaender, H.L.: NC-algorithms for graphs with small treewidth. In: Proc. 14th Workshop Graph-Theoretic Concepts in Computer Science WG'88, SpringerVerlag, Lecture Notes in Computer Science 344 (1989) 1-10
10. Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34 (2005) 825-847
11. Wanke, E.: k-nlc graphs and polynomial algorithms. Discrete Applied Mathematics 54 (1994) 251-266
12. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 (2000) 77-114
13. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discret. Math. 5 (1992) 596-603
14. Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width minimization is np-hard. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, New York, NY, USA, ACM Press (2006)
15. il Oum, S.: Approximating rank-width and clique-width quickly. In Kratsch, D., ed.: WG. Volume 3787 of Lecture Notes in Computer Science., Springer (2005) 49-58