{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:00:34Z","timestamp":1743091234267,"version":"3.40.3"},"publisher-location":"Heidelberg","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319000282"},{"type":"electronic","value":"9783319000299"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-00029-9_16","type":"book-chapter","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T05:52:43Z","timestamp":1360043563000},"page":"179-187","source":"Crossref","is-referenced-by-count":0,"title":["On Confidentially Connected-Free Graphs"],"prefix":"10.1007","author":[{"given":"Mihai","family":"Talmaciu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Nechita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barna","family":"Iantovics","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Berge, C.: Graphs. Nort-Holland, Amsterdam (1985)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Berry, A., Bordat, J.-P., Heggernes, P.: Recognizing weakly triangulated graphs by edge separability, Res. Rep. LIRMM, submittted to SWAT (2000)","DOI":"10.1007\/3-540-44985-X_13"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-54029-6_157","volume-title":"Advances in Computing and Information - ICCI \u201991","author":"M.C. Carlisle","year":"1991","unstructured":"Carlisle, M.C., Loyd, E.L.: On the k-Coloring of Intervals. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol.\u00a0497, pp. 90\u2013101. Springer, Heidelberg (1991)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","volume":"39","author":"V. Chvatal","year":"1985","unstructured":"Chvatal, V.: Star cutsets and perfect graphs. J. Combin. Theory, Ser. B\u00a039, 189\u2013199 (1985)","journal-title":"J. Combin. Theory, Ser B"},{"key":"16_CR5","series-title":"Monographs in population biology","first-page":"1","volume-title":"Food webs and niche space","author":"J.E. Cohen","year":"1978","unstructured":"Cohen, J.E.: Food webs and niche space. Monographs in population biology, vol.\u00a011, pp. xv+1 190. Princeton University Press, Princeton (1978) ISBN 978-0-691-08202-8"},{"issue":"3","key":"16_CR6","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.: Ateroidal triple-free graphs. SIAM J. Discrete Math.\u00a010(3), 399\u2013430 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR7","unstructured":"Croitoru, C., Olaru, E., Talmaciu, M.: Confidentially connected graphs, The annals of the University \"Dunarea de Jos\" of Galati. In: Proceedings of the Intern. Conf. \"The Risk in Contemporany Economy\", Supplement to Tome XVIII, XXII (2000)"},{"key":"16_CR8","unstructured":"Croitoru, C., Talmaciu, M.: On Confidentially connected graphs. Bul. Stiint. Univ. Baia Mare, Ser B, Matematica - Informatica XVI(1), 13\u201316 (2000)"},{"issue":"1-2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\u00a025(1-2), 71\u201376 (1961), doi:10.1007\/BF02992776","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"16_CR10","volume-title":"Automatic storage optimization","author":"J. Fabri","year":"1982","unstructured":"Fabri, J.: Automatic storage optimization. UMI Press Ann Arbor, MI (1982)"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015(3), 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"key":"16_CR12","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Hashimoto, A., Stevens, J.: Wire routing by optimizing channel assignment within large apertures. In: Proc., 8th IEEE Design Automation Workshop, pp. 155\u2013169 (1971)","DOI":"10.1145\/800158.805069"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0303-2647(82)90010-7","volume":"15","author":"J.R. Jungck","year":"1982","unstructured":"Jungck, J.R., Dick, O., Dick, A.G.: Computer assisted sequencing, Interval graphs and molecular evolution. Biosystem\u00a015, 259\u2013273 (1982)","journal-title":"Biosystem"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C.G. Lekkerkerker","year":"1962","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)","journal-title":"Fund. Math."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/TCS.1979.1084695","volume":"26","author":"T. Ohtsuki","year":"1979","unstructured":"Ohtsuki, T., Mori, H., Khu, E.S., Kashiwabara, T., Fujisawa, T.: One dimensional logic gate assignment and interval graph. IEEE Trans. Circuits and Systems\u00a026, 675\u2013684 (1979)","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"16_CR17","unstructured":"Talmaciu, M.: Decomposition problems in the graph theory with applications in combinatorial optimization - Ph. D. Thesis, University \"Al. I. Cuza\" Iasi, Romania (2002)"},{"issue":"3","key":"16_CR18","doi-asserted-by":"crossref","first-page":"457","DOI":"10.15388\/Informatica.2007.188","volume":"18","author":"M. Talmaciu","year":"2007","unstructured":"Talmaciu, M., Nechita, E.: Recognition algorithm for diamond-free graphs. Informatica\u00a018(3), 457\u2013462 (2007)","journal-title":"Informatica"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/bioinformatics\/10.3.309","volume":"10","author":"P. Zhang","year":"1994","unstructured":"Zhang, P., Schon, E.A., Fischer, S.G., Cayanis, E., Weiss, J., Kistler, S., Bourne, P.E.: An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA. Bioinformatics\u00a010(3), 309\u2013317 (1994), doi:10.1093\/bioin-formatics\/10.3.309","journal-title":"Bioinformatics"}],"container-title":["Studies in Computational Intelligence","Advances in Intelligent Analysis of Medical Data and Decision Support Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00029-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T13:34:33Z","timestamp":1675949673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00029-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319000282","9783319000299"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00029-9_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}