{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:44Z","timestamp":1725558644830},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651956"},{"type":"electronic","value":"9783540494942"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/10692760_16","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T12:35:37Z","timestamp":1277901337000},"page":"192-202","source":"Crossref","is-referenced-by-count":3,"title":["Diameter Determination on Restricted Graph Families"],"prefix":"10.1007","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":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A characterization of rigid circuit graphs. Discr. Math.\u00a09, 205\u2013212 (1974)","journal-title":"Discr. Math."},{"unstructured":"Chepoi, V.D., Dragan, F.F.: Disjoint set problem (1992) (unpublished)","key":"16_CR2"},{"doi-asserted-by":"crossref","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. Technical Report 294-95, University of Toronto, To appear in SIAM Journal of Computing (January 1995)","key":"16_CR3","DOI":"10.1007\/3-540-60084-1_82"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics\u00a010(3), 399\u2013431 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Dragan, F., Nicolai, F., Brandst\u00e4dt, A.: Lex-BFS orderings and powers of graphs. In: D\u2019Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol.\u00a01197, pp. 166\u2013180. Springer, Heidelberg (1997)","key":"16_CR5","DOI":"10.1007\/3-540-62559-3_15"},{"volume-title":"Optimal Discrete Structures and Algorithms","year":"1997","author":"F. Dragan","unstructured":"Dragan, F.: Almost diameter in hhd-free graphs in linear time via lex-bfs. In: Optimal Discrete Structures and Algorithms. University of Rostock, Germany (1997)","key":"16_CR6"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of a path in a tree are exactly the chordal graphs. Journ. Comb. Theory\u00a016, 47\u201356 (1974)","journal-title":"Journ. Comb. Theory"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(75)90021-7","volume":"13","author":"F. Gavril","year":"1975","unstructured":"Gavril, F.: A recognition algorithm for the intersection graph of directed paths in directed trees. Discr. Math.\u00a013, 337\u2013349 (1975)","journal-title":"Discr. Math."},{"volume-title":"Algorithms Graph Theory and Perfect Graphs","year":"1980","author":"M.C. Golumbic","unstructured":"Golumbic, M.C.: Algorithms Graph Theory and Perfect Graphs. Academic Press, New york University (1980)","key":"16_CR9"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","volume":"9","author":"B. Jamison","year":"1988","unstructured":"Jamison, B., Olariu, S.: On the semi-perfect elimination. Advances in Applied Mathematics\u00a09, 364\u2013376 (1988)","journal-title":"Advances in Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Lekkerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fund. Math.\u00a051, 45\u201364 (1962)","key":"16_CR11","DOI":"10.4064\/fm-51-1-45-64"},{"unstructured":"Lesk, M.: Couplages maximaux et diam\u00e8tre de graphes. PhD thesis, Universit\u00e9 Pierre et Marie Curie, Paris 6 (October 1984)","key":"16_CR12"},{"unstructured":"Paul, C.: Parcours en largeur lexicographique: un algorithme de partitionnement, application aux graphes et g\u00e9n\u00e9ralisation. PhD thesis, LIRMM, Universit\u00e9 de Montpellier II (1998)","key":"16_CR13"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM Journal of Computing\u00a05(2), 266\u2013283 (1976)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10692760_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:08:27Z","timestamp":1559218107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10692760_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651956","9783540494942"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/10692760_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}
