{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:33Z","timestamp":1759638993558},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"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-57785-8_186","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:21:18Z","timestamp":1330244478000},"page":"735-746","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dominating cliques in graphs with hypertree structure"],"prefix":"10.1007","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"unstructured":"H. Behrendt and A. Brandst\u00e4dt, Domination and the use of maximum neighbourhoods, Technical Report SM-DU-204, University of Duisburg 1992","key":"60_CR1"},{"unstructured":"C. Berge, Hypergraphs, North Holland, 1989","key":"60_CR2"},{"unstructured":"A. Brandstadt, Special graph classes \u2014 a survey, Technical Report SMDU-199, University of Duisburg 1993","key":"60_CR3"},{"doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, F.F. Dragan, V.D. Chepoi, and V.I. Voloshin, Dually chordal graphs, Technical Report SM-DU-225, University of Duisburg 1993","key":"60_CR4","DOI":"10.1007\/3-540-57899-4_56"},{"key":"60_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","volume":"54","author":"A. Brandst\u00e4dt","year":"1987","unstructured":"A. Brandst\u00e4dt and D. Kratsch, Domination problems on permutation and other graphs, Theoretical Computer Science 54 (1987) 181\u2013198","journal-title":"Theoretical Computer Science"},{"key":"60_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","volume":"22","author":"G.J. Chang","year":"1988\/89","unstructured":"G.J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs, Discrete Applied Mathematics 22 (1988\/89), 21\u201334","journal-title":"Discrete Applied Mathematics"},{"key":"60_CR7","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 problem on sun-free chordal graphs, SIAM J. Alg. Discr. Meth. 5 (1984), 332\u2013345","journal-title":"SIAM J. Alg. Discr. Meth."},{"unstructured":"F.F. Dragan, Domination in Helly graphs without quadrangles, (in Russian), in press","key":"60_CR8"},{"unstructured":"F.F. Dragan, Centers of graphs and the Helly property, (in Russian) Ph.D. Thesis, Moldova State University 1989","key":"60_CR9"},{"key":"60_CR10","first-page":"17","volume":"N. 51","author":"F.F. Dragan","year":"1991","unstructured":"F.F. Dragan, Dominating and packing in triangulated graphs, (in Russian), Meth. of Discrete Analysis (Novosibirsk), 1991, N. 51, 17\u201336","journal-title":"Meth. of Discrete Analysis (Novosibirsk)"},{"unstructured":"F.F. Dragan, HT-graphs: centers, connected r-domination and Steiner trees, manuscript 1992, to appear in Comput. Sci. J. of Moldova, Kishinev 1993","key":"60_CR11"},{"issue":"4","key":"60_CR12","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), Diskretnaja Matematika, Moscow, vol. 4, 4 (1992), 67\u201373","journal-title":"Diskretnaja Matematika, Moscow"},{"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":"60_CR13"},{"key":"60_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M. Farber","year":"1984","unstructured":"M. Farber, Domination, independent domination and duality in strongly chordal graphs, Discrete Applied Mathematics 7 (1984), 115\u2013130","journal-title":"Discrete Applied Mathematics"},{"key":"60_CR15","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0607049","volume":"7","author":"M. Farber","year":"1986","unstructured":"M. Farber, and R.E. Jamison, Convexity in graphs and hypergraphs, SIAM J. Alg. Discr. Meth. 7 (1986), 433\u2013444","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"60_CR16","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":"60_CR17","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"},{"unstructured":"S.C. Hedetniemi and R. Laskar, (eds.), Topics on Domination, Annals of Discr. Math. 48, North-Holland, 1991","key":"60_CR18"},{"doi-asserted-by":"crossref","unstructured":"D. Kratsch, Finding dominating cliques efficiently, in in strongly chordal graphs and undirected path graphs, Annals of Discrete Mathematics 48, Topics on Domination, (S.L. Hedetniemi, R.C. Laskar, eds.), 225\u2013238","key":"60_CR19","DOI":"10.1016\/S0167-5060(08)71052-5"},{"unstructured":"D. Kratsch, P. Damaschke and A. Lubiw, Dominating cliques in chordal graphs, to appear in Discrete Mathematics","key":"60_CR20"},{"key":"60_CR21","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, Networks, 23(1993), 59\u201369","journal-title":"Networks, Networks"},{"issue":"No.2","key":"60_CR22","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., 1976, Vol. 5, No. 2, 266\u2013283","journal-title":"SIAM J. Comput."},{"unstructured":"J.L. Szwarcfiter and C.F. Bornstein, Clique graphs of chordal and path graphs, manuscript 1992","key":"60_CR23"},{"issue":"3","key":"60_CR24","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, On properties of triangulated graphs, (in Russian), Oper. Res. and Programming (Kishinev), 1982, 24\u201332","key":"60_CR25"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:09:33Z","timestamp":1558253373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_186","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":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}