{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:21:31Z","timestamp":1770067291466,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00281-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:10:32Z","timestamp":1027599032000},"page":"143-166","source":"Crossref","is-referenced-by-count":58,"title":["Diameter determination on restricted graph families"],"prefix":"10.1016","volume":"113","author":[{"given":"Derek G.","family":"Corneil","sequence":"first","affiliation":[]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00281-X_BIB1","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1137\/S0097539796303421","article-title":"Fast estimation of diameter and shortest paths (without matrix multiplication)","volume":"28","author":"Aingworth","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB2","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hyper-tree structure and maximum neighborhood orderings, in: E.W. Mayr, G. Schmidt, G. Tinhofer (Eds.), Proceedings of WG\u201994 Graph\u2013Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 903, Springer, Berlin, 1995, pp. 65\u201380; Discrete Appl. Math. 82 (1998) 43\u201377.","DOI":"10.1007\/3-540-59071-4_38"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB4","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1021\/ci9600869","article-title":"On distances in benzenoid systems","volume":"36","author":"Chepoi","year":"1996","journal-title":"J. Chem. Inference Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB5","unstructured":"V.D. Chepoi, F.F. Dragan, Disjoint sets problem, unpublished, 1992."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB6","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progression, Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB7","series-title":"Proceedings of WG\u201998 Graph-Theoretic Concepts in Computer Science","first-page":"192","article-title":"Diameter determination on restricted graph families","volume":"Vol. 1517","author":"Corneil","year":"1988"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB8","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1137\/S0097539795282377","article-title":"Linear time algorithms for dominating pairs in asteroidal triple-free graphs","volume":"28","author":"Corneil","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/S0895480193250125","article-title":"Asteroidal triple-free graphs","volume":"10","author":"Corneil","year":"1997","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB10","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, Optimal (parallel) algorithms for the all-to-all vertex distances problem for certain graph classes, in: Proceedings of WG\u201992, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 657, Springer, Berlin, 1993, pp. 60\u201369.","DOI":"10.1007\/3-540-56402-0_36"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB11","series-title":"Proceedings of SWAT\u201994 Fourth Scandinavian Workshop on Algorithm Theory","first-page":"370","article-title":"Dominating cliques in distance-hereditary graphs","volume":"Vol. 824","author":"Dragan","year":"1994"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(99)00077-3","article-title":"Almost diameter of a house-hole-free graph in linear time via LexBFS","volume":"95","author":"Dragan","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0166-218X(99)00157-2","article-title":"LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem","volume":"98","author":"Dragan","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB14","doi-asserted-by":"crossref","unstructured":"F.F. Dragan, F. Nicolai, A. Brandst\u00e4dt, LexBFS-orderings and powers of graphs, Proceedings of the WG\u201996, Lecture Notes in Computer Science, Vol. 1197, Springer, Berlin, 1997, pp. 166\u2013180.","DOI":"10.1007\/3-540-62559-3_15"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(80)90039-6","article-title":"Computation of the center and diameter of outerplanar graphs","volume":"2","author":"Farley","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graph of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB19","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0166-218X(96)00103-5","article-title":"Unified all-pairs shortest path algorithms in the chordal hierarchy","volume":"77","author":"Han","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","article-title":"Minimax location of a facility in an undirected tree graph","volume":"7","author":"Handler","year":"1973","journal-title":"Transp. Sci."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB22","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","article-title":"On the semi-perfect elimination","volume":"9","author":"Jamison","year":"1988","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB23","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB24","doi-asserted-by":"crossref","unstructured":"M. Lesk, Couplages maximaux et diam\u00e8tre de graphes, Ph.D. Thesis, Universit\u00e9 Pierre et Marie Curie, Paris 6, October 1984.","DOI":"10.1051\/ro\/1984180302471"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/00207169008803870","article-title":"A simple linear-time algorithm for computing the center of an interval graph","volume":"34","author":"Olariu","year":"1990","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB26","unstructured":"C. Paul, Parcours en largeur lexicographique: un algorithme de partitionnement, application aux graphes et g\u00e9n\u00e9ralisation, Ph.D. Thesis, University of Montpellier II, France, 1998."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB27","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects on vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00281-X_BIB28","doi-asserted-by":"crossref","unstructured":"R. Seidel, On the all-pair-shortest-path problem, Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 745\u2013749.","DOI":"10.1145\/129712.129784"},{"key":"10.1016\/S0166-218X(00)00281-X_BIB29","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000281X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000281X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:53:00Z","timestamp":1556257980000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0000281X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":29,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X0000281X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00281-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}