Optimal distance labeling for interval and circular-arc graphs

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

Volumn 2832, Issue , 2003, Pages 254-265

  Gavoille, Cyril ^a   Paul, Christophe ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b LIRMM   (France)

Author keywords

Circular arc graphs; Data structure; Distance queries; Interval graphs; Labeling scheme

Indexed keywords

DATA STRUCTURES;

CIRCULAR-ARC GRAPH; DISTANCE LABELING; DISTANCE LABELING SCHEMES; DISTANCE QUERIES; INTERVAL GRAPH; LABELING SCHEME; PREPROCESSING TIME; SPACE DATA STRUCTURES;

GRAPHIC METHODS;

EID: 0142152738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_25     Document Type: Article

References (30)

1. th Symp. on Discrete Algorithms (SODA), 2001, pp. 547-556.
2. th Symp. on Discrete Algorithms (SODA), 2003.
3. th ACM Symp. on Parallel Algorithms and Architecture (SPAA), Aug. 2002, pp. 258-264.
4. rd IEEE Symp. on Foundations of Computer Science (FOCS), 2002, pp. 53-62.
5. O. BERKMAN AND U. VISHKIN, Finding level-ancestors in trees, J. of Computer and System Sciences, 48 (1994), pp. 214-230.
6. D. Z. CHEN, D. LEE, R. SRIDHAR, AND C. N. SEKHARAN, Solving the all-pair shortest path query problem on interval and circular-arc graphs, Networks, 31 (1998), pp. 249-257.
7. J. E. COHEN, J. KOMLÓS, AND T. MUELLER, The probability of an interval graph, and why it matters, Proc. of Symposia in Pure Mathematics, 34 (1979), pp. 97-115.
8. D. CORNEIL, H. KIM, S. NATARAJAN, S. OLARIU, AND A. SPRAGUE, Simple linear time algorithm of unit interval graphs, Info. Proces. Letters, 55 (1995), pp. 99-104.
9. B. COURCELLE AND R. VANICAT, Query efficient implementation of graphs of bounded clique width, Discrete Applied Mathematics, (2001). To appear.
10. G. DE FIGUEIREDO HERRERA, J. MEIDANIS, AND C. PICININ DE MELLO, A linear-time algorithm for proper interval recognition, Information Processing Letters, 56 (1995), pp. 179-184.
11. C. GAVOILLE, Routing in distributed networks: Overview and open problems, ACM SIGACT News - Distributed Computing Column, 32 (2001), pp. 36-52.
12. th European Symp. on Algorithms (ESA), vol. 2161 of LNCS, Springer, 2001, pp. 476-488.
13. C. GAVOILLE AND C. PAUL, Distance labeling scheme and split decomposition, Discrete Mathematics, (2003). To appear.
14. C. GAVOILLE AND D. PELEG, Compact and localized distributed data structures, Research Report RR-1261-01, LaBRI, University of Bordeaux, Aug. 2001. To appear in J. of Distributed Computing for the PODC 20-Year Special Issue.
15. th Symp. on Discrete Algorithms (SODA), 2001, pp. 210-219.
16. P. HANLON, Counting interval graphs, Transactions of the American Mathematical Society, 272 (1982), pp. 383-426.
17. P. HELL, J. BANG-JENSEN, AND J. HUANG, Local tournaments and proper circular arc graphs, in Algorithms, Int. Symp. SIGAL, vol. 450 of LNCS, 1990, pp. 101-108.
18. S. KANNAN, M. NAOR, AND S. RUDICH, Implicit representation of graphs, SIAM J. on Discrete Mathematics, 5 (1992), pp. 596-603.
19. th Symp. on Discrete Algorithms (SODA), 2002.
20. th Symp. on Discrete Algorithms (SODA), 2002, pp. 927-936.
21. th Symp. on Theoretical Aspects of Computer Science (STAGS), vol. 1770 of LNCS, Springer Verlag, 2000, pp. 516-528.
22. th Symp. on Theoretical Aspects of Computer Science (STACS), vol. 2285 of LNCS, Springer, 2002, pp. 76-87.
23. th IEEE Symp. on Foundations of Computer Science (FOCS), 2001.
24. th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), vol. 1893 of LNCS, Springer, 2000, pp. 579-588.
25. _, Proximity-preserving labeling schemes, J. of Graph Theory, 33 (2000).
26. F. ROBERTS, Indifference graphs, in Proof Techniques in Graph Theory, Academic Press, 1969, pp. 139-146.
27. th IEEE Symp. on Foundations of Computer Science (FOCS), 2001.
28. rd ACM Symp. on Theory of Computing (STOC), 2001, pp. 183-192.
29. th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 2001, pp. 1-10.
30. n, PhD thesis, University of Göttingen, 1967.