{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:10:04Z","timestamp":1773324604077,"version":"3.50.1"},"reference-count":30,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5031,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1993,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A new class of chordal graphs, containing the class of strongly chordal graphs, is introduced. It is shown that these graphs, called doubly chordal graphs, are related to acyclic hypergraphs and are recognizable in polynomial time. Furthermore, after proving that the Steiner tree and the connected domination problems are polynomially solvable for doubly chordal graphs, it is shown that both problems are NP\u2010hard for a class of chordal graphs (called Helly chordal graphs) containing the class of doubly chordal graphs. \u00a9 <jats:italic>1993 John Wiley &amp; Sons, Inc.<\/jats:italic><\/jats:p>","DOI":"10.1002\/net.3230230108","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T13:49:55Z","timestamp":1178977795000},"page":"59-69","source":"Crossref","is-referenced-by-count":35,"title":["Doubly chordal graphs, steiner trees, and connected domination"],"prefix":"10.1002","volume":"23","author":[{"given":"M.","family":"Moscarini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(81)90059-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90028-2"},{"key":"e_1_2_1_4_2","first-page":"27","volume-title":"Advances in Database Theory","author":"Ausiello G.","year":"1984"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90018-8"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579383"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322389"},{"key":"e_1_2_1_8_2","volume-title":"Graphs","author":"Berge C.","year":"1985"},{"key":"e_1_2_1_9_2","first-page":"43","volume-title":"Advances in Computing Research","author":"D'Atri A.","year":"1986"},{"key":"e_1_2_1_10_2","first-page":"67","article-title":"Classical perfect graphs: An introduction with emphasis on triangulated and interval graphs","volume":"21","author":"Duchet P.","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90154-1"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90061-1"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90154-1"},{"key":"e_1_2_1_15_2","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_16_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/319758.319775"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2157.322405"},{"key":"e_1_2_1_19_2","series-title":"Technical Report","author":"Graham M. H.","year":"1979"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/0606070"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700027300"},{"key":"e_1_2_1_22_2","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz L.","year":"1979"},{"key":"e_1_2_1_23_2","unstructured":"A.Lubiw \u0393\u2010free matrices. Master's Thesis Dept. Combinatorics and Optimization University of Waterloo (1982)."},{"key":"e_1_2_1_24_2","unstructured":"A.Lubiw Orderings and some combinatorial optimization problems with geometric applications. PhD Thesis Dept. of Computer Science University of Toronto (1985)."},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1137\/0216057"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90030-6"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/0213035"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150109"},{"key":"e_1_2_1_30_2","unstructured":"M.Yannakakis Algorithms for acyclic database schemes.Proceedings of the 7th Conference on Very Large Data Bases(1981)82\u201394."},{"key":"e_1_2_1_31_2","unstructured":"C. T.YuandM. X.Ozsoyoglu An algorithm for treequery membership of a distributed query.Proceedings of the COMPSAC 79 IEEE New York (Nov. 79)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230230108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230230108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T10:38:56Z","timestamp":1698230336000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230230108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1002\/net.3230230108"],"URL":"https:\/\/doi.org\/10.1002\/net.3230230108","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}