On Compact and Efficient Routing in Certain Graph Classes-Reference-Cited by-同舟云学术

On Compact and Efficient Routing in Certain Graph Classes

Published:2004 Issue: Volume: Page:402-414
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Dragan Feodor F.,Lomonosov Irina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30551-4_36

Reference18 articles.

1. Brandstädt, A., Dragan, F.F., Nicolai, F.: Homogeneously orderable graphs. Theoretical Computer Science 172, 209–232 (1997)

2. Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Math. Appl., SIAM, Philadelphia (1999)

3. Dourisboure, Y.: Routage compact et longueur arborescente, PhD Thesis, LaBRI, University of Bordeaux I (December 2003)

4. Lecture Notes in Computer Science;Y. Dourisboure,2002

5. Dragan, F.F., Lomonosov, I.: New Routing Schemes for Interval Graphs, Circular-Arc Graphs, and Permutation Graphs. In: Proc. of the 14th IASTED Intern. Conf. on Paral. and Distr. Comp. and Syst., Cambridge, USA, pp. 78–83 (2003)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Short Labels by Traversal and Jumping;Structural Information and Communication Complexity;2006

2. Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes;Lecture Notes in Computer Science;2006

3. Compact Routing for Graphs Excluding a Fixed Minor;Lecture Notes in Computer Science;2005

4. Collective Tree Spanners of Graphs;Algorithm Theory - SWAT 2004;2004

5. Distributed Relationship Schemes for Trees;Algorithms and Computation