Distance labeling scheme and split decomposition

Discrete Mathematics

Volumn 273, Issue 1-3, 2003, Pages 115-130

  Gavoille, Cyril ^a   Paul, Christophe ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b LIRMM   (France)

Author keywords

Distance labeling scheme; Distance hereditary graphs; Split decomposition

Indexed keywords

APPROXIMATION THEORY; ESTIMATION; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

DISTANCE LABELING SCHEMES; SPLIT DECOMPOSITION;

TREES (MATHEMATICS);

EID: 0344945601     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00232-2     Document Type: Conference Paper

References (33)

1. Aïder M. Almost distance-hereditary graphs. Discrete Math. 242:2002;1-16.
2. S. Alstrup, P. Bille, T. Rauhe, Labeling schemes for small distances in trees, in: 15th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2003.
3. S. Alstrup, C. Gavoille, H. Kaplan, T. Rauhe, Nearest common ancestors: a survey and a new distributed algorithm, in: 14th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), ACM PRESS, August 2002, pp. 258-264.
4. S. Alstrup, T. Rauhe, Improved labeling scheme for ancestor queries, in: 13th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2002, pp. 947-953.
5. S. Alstrup, T. Rauhe, Small induced-universal graphs and compact implicit graph representations, in: 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, November 2002.
6. Barefoot C. Block-cutvertex trees and block-cutvertex partitions. Discrete Math. 256(1-2):2002;35-54.
7. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph Classes - A survey, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 1999.
8. Breuer M.A., Folkman J. An unexpected result on coding the vertices of a graph. J. Math. Anal. and Appl. 20:1967;583-600.
9. S. Cicerone, G. D'Ermiliis, G. Di Stefano, (k,+) -distance-hereditary graphs, in: 27th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, Vol. 2204, Springer, Berlin, June 2001, pp. 66-77.
10. S. Cicerone, G. Di Stefano, Networks with small stretch number, in: 26th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, Vol. 1928, Springer, Berlin, June 2000, pp. 95-106.
11. Cicerone S., Di Stefano G. Graphs with bounded induced distance. Discrete Appl. Math. 108(1-2):2001;3-21.
12. D.G. Corneil, M. Habib, J.-M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition algorithm of clique-width ≤ 3 graphs, in: Latin American Symposium on Theoretical Informatics (LATIN), Lecture Notes in Computer Science, Vol. 1776, 2000, pp. 126-134.
13. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46:1993;218-270.
14. B. Courcelle, R. Vanicat, Query efficient implementation of graphs of bounded clique width, Discrete Appl. Math. (2001), to appear.
15. Cunninghan W.H. Decomposition of directed graphs. SIAM J. Algebraic Discrete Methods. 3:1982;214-228.
16. E. Dahlhaus, Efficient parallel and linear time sequential split decomposition, in: 14th Conference on Foundations of Software Technology and Theoretical Computer Science (FST& TCS), Lecture Notes in Computer Science, Vol. 880, Springer, Berlin, December 1994, pp. 171-180.
17. C. Gavoille, M. Katz, N.A. Katz, C. Paul, D. Peleg, Approximate distance labeling schemes, in: nineth Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Vol. 261, Springer, Berlin, August 2001, pp. 476-488.
18. C. Gavoille, D. Peleg, Compact and Localized distributed data structures, Research Report RR-1261-01, LaBRI, University of Bordeaux, France, August 2001, J. Distrib. Comput. for the PODC 20-Year Special Issue, to appear.
19. C. Gavoille, D. Peleg, S. Pérennes, R. Raz, Distance labeling in graphs, in: 12th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2001, pp. 210-219.
20. R.L. Graham, H.O. Pollak, On embedding graphs in squashed cubes, Lecture Notes in Mathematics, Vol. 303, 1972, pp. 99-110.
21. Hammer P.L., Maffray F. Completely separable graphs. Discrete Appl. Math. 27:1990;85-99.
22. Howorka E. On metric properties of certain clique graphs. J. Combin. Theory B. 27:1979;67-74.
23. Kannan S., Naor M., Rudich S. Implicit representation of graphs. SIAM J. Discrete Math. 5:1992;596-603.
24. H. Kaplan, T. Milo, Parent and ancestor queries using a compact index, in: 20th ACM Symposium on Principles of Database Systems (PODS), ACM-SIAM, May 2001.
25. M. Katz, N.A. Katz, A. Korman, D. Peleg, Labeling schemes for flow and connectivity, in: 13th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2002, pp. 927-936.
26. Kay D.C., Chartrand G. A characterization of certain ptolemaic graphs. Canad. J. Math. 17:1965;342-346.
27. J.-M. Lanlignel, Autour de la décomposition en coupes, Ph.D. Thesis, Université Montpellier II - Sciences et Techniques du Languedoc, June 2001.
28. Olariu S. Weak-bipolarizable graphs. Discrete Math. 74:1989;159-171.
29. D. Peleg, Informative labeling schemes for graphs, in: 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, August 2000, pp. 579-588.
30. Peleg D. Proximity-preserving labeling schemes. J. Graph Theory. 33:2000;167-176.
31. Plummer M.D. On minimal blocks. Trans. Amer. Math. Soc. 134:1968;85-94.
32. Robertson N., Seymour P.D. Graph minors. III. planar tree-width. J. Combin. Theory. 36:1984;49-64.
33. J.P. Spinrad, Efficient Graph Representations, 2000, in preparation.