{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T21:35:07Z","timestamp":1700256907082},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00201-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"81-88","source":"Crossref","is-referenced-by-count":7,"title":["The recognition of geodetically connected graphs"],"prefix":"10.1016","volume":"65","author":[{"given":"Jou-Ming","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Wen","family":"Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00201-9_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB2","series-title":"Proc. Internat. Computer Symp.","first-page":"277","article-title":"An efficient algorithm for finding the set of all hinge-vertices in strongly chordal graphs","author":"Chang","year":"1994"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB3","series-title":"Proc. Internat. Computer Symp. on Algorithms","first-page":"105","article-title":"The characterizations of hinge-free networks","author":"Chang","year":"1996"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB5","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/TCS.1977.1084370","article-title":"Geodetic connectivity of graphs","volume":"24","author":"Entringer","year":"1977","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB6","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\/S0020-0190(97)00201-9_BIB7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0607049","article-title":"Convexity in graphs and hypergraphs","volume":"7","author":"Farber","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1142\/S0129626493000423","article-title":"Self-repairing networks","volume":"3","author":"Farley","year":"1993","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB9","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB14","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(96)00092-0","article-title":"A linear time algorithm for finding all hinge vertices of a permutation graph","volume":"59","author":"Ho","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/jgt.3190050314","article-title":"A characterization of ptolemaic graphs","volume":"5","author":"Howorka","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB17","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB18","series-title":"Graph theory and Computing","article-title":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations","author":"Rose","year":"1972"},{"key":"10.1016\/S0020-0190(97)00201-9_BIB19","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","article-title":"Doubly lexical orderings of dense 0\u20131 matrices","volume":"45","author":"Spinrad","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00201-9_BIB21","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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:10Z","timestamp":1556058430000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097002019"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00201-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}