{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:23Z","timestamp":1725664043764},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_56","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:23Z","timestamp":1330263623000},"page":"237-251","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Dually chordal graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor D.","family":"Chepoi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly I.","family":"Voloshin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","volume":"5","author":"R. P. Anstee","year":"1984","unstructured":"R.P. Anstee and M. Farber, Characterizations of totally balanced matrices, J. Algorithms, 5(1984), 215\u2013230","journal-title":"J. Algorithms"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(86)90018-8","volume":"33","author":"G. Ausiello","year":"1986","unstructured":"G. Ausiello, A. D'Atri, and M. Moscarini, Chordality properties on graphs and minimal conceptual connections in semantic data models, Journal of Computer and System Sciences vol. 33, (1986),179\u2013202","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"H.-J. Bandelt, Neighbourhood-Helly Powers, manuscript 1992, University of Hamburg","key":"21_CR3"},{"issue":"2","key":"21_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02122796","volume":"8","author":"H.-J. Bandelt","year":"1988","unstructured":"H.-J. Bandelt, Hereditary modular graphs, Combinatorica 8 (2) (1988), 149\u2013157","journal-title":"Combinatorica"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(87)90058-8","volume":"16","author":"H.-J. Bandelt","year":"1987","unstructured":"H.-J. Bandelt, A. D\u00e4hlmann, and H. Sch\u00fctte, Absolute retracts of bipartite graphs, Discrete Applied Mathematics 16 (1987), 191\u2013215","journal-title":"Discrete Applied Mathematics"},{"unstructured":"H.-J. Bandelt, M. Farber, and P. Hell, Absolute reflexive retracts and absolute bipartite retracts, Discrete Mathematics, to appear","key":"21_CR6"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0012-365X(86)90212-8","volume":"62","author":"H.-J. Bandelt","year":"1986","unstructured":"H.-J. Bandelt, and H. M. Mulder, Pseudo-modular graphs, Discrete Mathematics, 62 (1986), 245\u2013260","journal-title":"Discrete Mathematics"},{"issue":"1","key":"21_CR8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","volume":"51","author":"H.-J. Bandelt","year":"1991","unstructured":"H.-J. Bandelt, and E. Prisner, Clique graphs and Helly graphs, Journal of Combinatorial Theory B, 51,1 (1991),34\u201345","journal-title":"Journal of Combinatorial Theory B"},{"issue":"3","key":"21_CR9","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Berri","year":"1983","unstructured":"C. Berri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes, Journal of the ACM, 30,3 (1983), 479\u2013513","journal-title":"Journal of the ACM"},{"unstructured":"H. Behrendt and A. Brandst\u00e4dt, Domination and the use of maximum neighbourhoods, technical report SM-DU-204, University of Duisburg 1992","key":"21_CR10"},{"unstructured":"C. Berge, Hypergraphs, North Holland, 1989","key":"21_CR11"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(91)90023-P","volume":"32","author":"A. Brandst\u00e4dt","year":"1991","unstructured":"A. Brandst\u00e4dt, Classes of bipartite graphs related to chordal graphs, Discrete Applied Mathematics, 32 (1991), 51\u201360","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(83)90088-2","volume":"47","author":"A. E. Brouwer","year":"1983","unstructured":"A. E. Brouwer, P. Duchet, and A. Schrijver, Graphs whose neighbourhoods have no special cycles, Discrete Mathematics 47 (1983), 177\u2013182","journal-title":"Discrete Mathematics"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"P. Buneman, A characterization of rigid circuit graphs, Discr. Math., 9 (1974), 205\u2013212","journal-title":"Discr. Math."},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/BF01581045","volume":"22","author":"R. Chandrasekaran","year":"1982","unstructured":"R. Chandrasekaran and A. Tamir, Polynomially bounded algorihtms for locating p-centers on a tree, Math. Programming, 22 (1982), 304\u2013315","journal-title":"Math. Programming"},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","volume":"5","author":"G. J. Chang","year":"1984","unstructured":"G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Algebraic and Discrete Methods, 5(1984), 332\u2013345","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"issue":"5","key":"21_CR17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90121-4","volume":"29","author":"A. D'Atri","year":"1988","unstructured":"A. D'Atri and M. Moscarini, On hypergraph acyclicity and and graph chordality, Inf. Proc. Letters, 29,5 (1988), 271\u2013274","journal-title":"Inf. Proc. Letters"},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G. A. Dirac","year":"1961","unstructured":"G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25(1961), 71\u201376","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"unstructured":"F. F. Dragan, Centers of graphs and the Helly property, (in Russian) Ph.D. Thesis, Moldova State University 1989","key":"21_CR19"},{"unstructured":"F.F. Dragan, Conditions for coincidence of local and global minimums for the eccentricity function on graphs and the Helly property, (in Russian), Res. in Appl. Math. and Inform. (Kishinev), 1990, 49\u201356","key":"21_CR20"},{"unstructured":"F.F. Dragan, HT-graphs: centers, connected r-domination and Steiner trees, manuscript 1992","key":"21_CR21"},{"key":"21_CR22","first-page":"67","volume":"4","author":"F. F. Dragan","year":"1992","unstructured":"F. F. Dragan, C. F. Prisacaru, and V. D. Chepoi, Location problems in graphs and the Helly property (in Russian), Discrete Mathematics, Moscow, 4(1992), 67\u201373 (the full version appeared as preprint: F.F. Dragan, C.F. Prisacaru, and V.D. Chepoi, r-Domination and p-center problems on graphs: special solution methods and graphs for which this method is usable (in Russian), Kishinev State University, preprint Mold-NIINTI, N. 948-M88, 1987)","journal-title":"Discrete Mathematics, Moscow"},{"unstructured":"F. F. Dragan and V. I. Voloshin, Hypertrees and associated graphs, manuscript Moldova State University 1992","key":"21_CR23"},{"unstructured":"P. Duchet, Propriete de Helly et problemes de representation, Colloqu. Intern. CNRS 260, Problemes Combin. et Theorie du Graphes, Orsay, France 1976, 117\u2013118","key":"21_CR24"},{"key":"21_CR25","first-page":"67","volume":"21","author":"P. Duchet","year":"1984","unstructured":"P. Duchet, Classical perfect graphs: an introduction with emphasis on triangulated and interval graphs, Ann. Discr. Math., 21(1984), 67\u201396","journal-title":"Ann. Discr. Math."},{"key":"21_CR26","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes, J. ACM, 30 (1983), 514\u2013550","journal-title":"J. ACM"},{"key":"21_CR27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"M. Farber, Characterizations of strongly chordal graphs, Discr. Math., 43 (1983), 173\u2013189","journal-title":"Discr. Math."},{"key":"21_CR28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(78)90154-1","volume":"21","author":"C. Flament","year":"1978","unstructured":"C. Flament, Hypergraphes arbores, Discrete Mathematics, 21 (1978), 223\u2013227","journal-title":"Discrete Mathematics"},{"key":"21_CR29","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D. R. Fulkerson","year":"1965","unstructured":"D.R. Fulkerson and O.R. Gross, Incidence matrices and interval graphs, Pacif. J. Math. 15 (1965), 835\u2013855","journal-title":"Pacif. J. Math."},{"key":"21_CR30","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980"},{"key":"21_CR31","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01864170","volume":"4","author":"M. C. Golumbic","year":"1988","unstructured":"M.C. Golumbic, Algorithmic aspects of intersection graphs and representation hypergraphs, Graphs and Combinatorics, 4 (1988), 307\u2013321","journal-title":"Graphs and Combinatorics"},{"key":"21_CR32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"M. C. Golumbic","year":"1978","unstructured":"M.C. Golumbic and C.F. Goss, Perfect elimination and chordal bipartite graphs, J. Graph theory, 2(1978), 155\u2013163","journal-title":"J. Graph theory"},{"key":"21_CR33","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1145\/2157.322405","volume":"30","author":"N. Goodman","year":"1983","unstructured":"N. Goodman and O. Shmueli, Syntactic characterization of tree database schemes, Journal of the ACM 30 (1983),767\u2013786","journal-title":"Journal of the ACM"},{"key":"21_CR34","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","volume":"6","author":"A. J. Hoffman","year":"1985","unstructured":"A.J. Hoffman, A.W.J. Kolen, and M. Sakarovitch, Totally balanced and greedy matrices, SIAM J. Alg. Discr. Methods, 6(1985), 721\u2013730","journal-title":"SIAM J. Alg. Discr. Methods"},{"key":"21_CR35","first-page":"201","volume":"25","author":"A. W. J. J. Kolen","year":"1983","unstructured":"A.W.J. Kolen, Duality in tree location theory, Cah. Cent. Etud. Rech. Oper., 25 (1983), 201\u2013215","journal-title":"Cah. Cent. Etud. Rech. Oper."},{"key":"21_CR36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(85)90156-6","volume":"57","author":"J. Lehel","year":"1985","unstructured":"J. Lehel, A characterization of totally balanced hypergraphs, Discr. Math., 57 (1985), 59\u201365","journal-title":"Discr. Math."},{"key":"21_CR37","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A. Lubiw","year":"1987","unstructured":"A. Lubiw, Doubly lexical orderings of matrices, SIAM J. Comput. 16 (1987), 854\u2013879","journal-title":"SIAM J. Comput."},{"key":"21_CR38","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230230108","volume":"23","author":"M. Moscarini","year":"1993","unstructured":"M. Moscarini, Doubly chordal graphs, Steiner trees and connected domination, Networks, 23(1993), 59\u201369","journal-title":"Networks"},{"key":"21_CR39","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput., 16(1987), 973\u2013989","journal-title":"SIAM J. Comput."},{"key":"21_CR40","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"D.J. Rose, R.E. Tarjan, and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5(1976), 266\u2013283","journal-title":"SIAM J. Comput."},{"unstructured":"J.P. Spinrad, Doubly lexical ordering of dense 0-1-matrices, manuscipt 1988, to appear in SIAM J. Comput.","key":"21_CR41"},{"unstructured":"J.L. Szwarcfiter and C.F. Bornstein, Clique graphs of chordal and path graphs, manuscript 1992","key":"21_CR42"},{"issue":"3","key":"21_CR43","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13,3 (1984), 566\u2013579","journal-title":"SIAM J. Comput."},{"unstructured":"V.I. Voloshin, Properties of triangulated graphs (in Russian), Issledovaniye operaziy i programmirovanie (Kishinev), 1982, 24\u201332","key":"21_CR44"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:01:26Z","timestamp":1558267286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}