{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T05:44:56Z","timestamp":1763444696352},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0012-365x(03)00232-2","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T03:43:33Z","timestamp":1063338213000},"page":"115-130","source":"Crossref","is-referenced-by-count":29,"title":["Distance labeling scheme and split decomposition"],"prefix":"10.1016","volume":"273","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00232-2_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(00)00401-5","article-title":"Almost distance-hereditary graphs","volume":"242","author":"A\u0131\u0308der","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB2","unstructured":"S. Alstrup, P. Bille, T. Rauhe, Labeling schemes for small distances in trees, in: 15th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2003."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB3","doi-asserted-by":"crossref","unstructured":"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\u2013264.","DOI":"10.1145\/564870.564914"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB4","unstructured":"S. Alstrup, T. Rauhe, Improved labeling scheme for ancestor queries, in: 13th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2002, pp. 947\u2013953."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/SFCS.2002.1181882"},{"issue":"1\u20132","key":"10.1016\/S0012-365X(03)00232-2_BIB6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0012-365X(01)00461-7","article-title":"Block-cutvertex trees and block-cutvertex partitions","volume":"256","author":"Barefoot","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB7","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.B. Le, J.P. Spinrad, Graph Classes\u2014A survey, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB8","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0022-247X(67)90082-0","article-title":"An unexpected result on coding the vertices of a graph","volume":"20","author":"Breuer","year":"1967","journal-title":"J. Math. Anal. and Appl."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB9","unstructured":"S. Cicerone, G. D'Ermiliis, G. Di Stefano, (k,+)-distance-hereditary graphs, in: 27th International Workshop, Graph\u2014Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, Vol. 2204, Springer, Berlin, June 2001, pp. 66\u201377."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB10","unstructured":"S. Cicerone, G. Di Stefano, Networks with small stretch number, in: 26th International Workshop, Graph\u2014Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, Vol. 1928, Springer, Berlin, June 2000, pp. 95\u2013106."},{"issue":"1\u20132","key":"10.1016\/S0012-365X(03)00232-2_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(00)00227-4","article-title":"Graphs with bounded induced distance","volume":"108","author":"Cicerone","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB12","unstructured":"D.G. Corneil, M. Habib, J.-M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition algorithm of clique-width \u2a7d 3 graphs, in: Latin American Symposium on Theoretical Informatics (LATIN), Lecture Notes in Computer Science, Vol. 1776, 2000, pp. 126\u2013134."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB13","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-rewriting hypergraph grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB14","unstructured":"B. Courcelle, R. Vanicat, Query efficient implementation of graphs of bounded clique width, Discrete Appl. Math. (2001), to appear."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB15","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","article-title":"Decomposition of directed graphs","volume":"3","author":"Cunninghan","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB16","doi-asserted-by":"crossref","unstructured":"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\u2013180.","DOI":"10.1007\/3-540-58715-2_123"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB17","doi-asserted-by":"crossref","unstructured":"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\u2013488.","DOI":"10.1007\/3-540-44676-1_40"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB18","unstructured":"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."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB19","unstructured":"C. Gavoille, D. Peleg, S. P\u00e9rennes, R. Raz, Distance labeling in graphs, in: 12th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2001, pp. 210\u2013219."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB20","doi-asserted-by":"crossref","unstructured":"R.L. Graham, H.O. Pollak, On embedding graphs in squashed cubes, Lecture Notes in Mathematics, Vol. 303, 1972, pp. 99\u2013110.","DOI":"10.1007\/BFb0067362"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0095-8956(79)90069-8","article-title":"On metric properties of certain clique graphs","volume":"27","author":"Howorka","year":"1979","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB23","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/0405049","article-title":"Implicit representation of graphs","volume":"5","author":"Kannan","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB24","unstructured":"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."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB25","unstructured":"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\u2013936."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB26","doi-asserted-by":"crossref","first-page":"342","DOI":"10.4153\/CJM-1965-034-0","article-title":"A characterization of certain ptolemaic graphs","volume":"17","author":"Kay","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB27","unstructured":"J.-M. Lanlignel, Autour de la d\u00e9composition en coupes, Ph.D. Thesis, Universit\u00e9 Montpellier II\u2014Sciences et Techniques du Languedoc, June 2001."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB28","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(89)90208-2","article-title":"Weak-bipolarizable graphs","volume":"74","author":"Olariu","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB29","unstructured":"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\u2013588."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB30","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","article-title":"Proximity-preserving labeling schemes","volume":"33","author":"Peleg","year":"2000","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1968-0228369-8","article-title":"On minimal blocks","volume":"134","author":"Plummer","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00232-2_BIB32","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors. III. planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(03)00232-2_BIB33","unstructured":"J.P. Spinrad, Efficient Graph Representations, 2000, in preparation."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002322?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002322?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T13:06:22Z","timestamp":1585141582000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X03002322"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00232-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}