{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:50Z","timestamp":1725543410185},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351573"},{"type":"electronic","value":"9783540351580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775096_25","type":"book-chapter","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T08:40:18Z","timestamp":1150965618000},"page":"267-278","source":"Crossref","is-referenced-by-count":5,"title":["Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs"],"prefix":"10.1007","author":[{"given":"David B.","family":"Chandler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maw-Shang","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.J. Bandelt","year":"1989","unstructured":"Bandelt, H.J., Mulder, H.M.: Distance-hereditary graphs. Journal of Combinatorial Theory, Series B\u00a041, 182\u2013208 (1989)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"25_CR2","unstructured":"Berry, A., Golumbic, M.C., Lipshteyn, M.: Two tricks to triangulate chordal probe graphs in polynomial time. In: Proceedings 15th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 962\u2013969 (2004)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Br\u00e4ndstadt, A., Van Bang, L., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.endm.2005.05.027","volume":"19","author":"Chang","year":"2005","unstructured":"Chang, Jennwha, G., Kloks, T., Peng, S.-L.: Probe interval bigraphs (extended abstract). Electronic Notes in Discrete Mathematics\u00a019, 195\u2013201 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-540-31856-9_43","volume-title":"STACS 2005","author":"Chang","year":"2005","unstructured":"Chang, Jennwha, G., Kloks, A.J.J., Liu, J., Peng, S.-L.: The PIGs full monty - a floor show of minimal separators. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 521\u2013532. Springer, Heidelberg (2005)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/11533719_82","volume-title":"Computing and Combinatorics","author":"M.-S. Chang","year":"2005","unstructured":"Chang, M.-S., Kloks, T., Kratsch, D., Liu, J., Peng, S.-L.: On the recognition of probe graphs of some self-complementary graph classes. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 808\u2013817. Springer, Heidelberg (2005)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-63890-3_37","volume-title":"Algorithms and Computation","author":"Chang","year":"1997","unstructured":"Chang, Maw-Shang, Hsieh, S.Y., Chen, G.H.: Dynamic programming on distance-hereditary graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 344\u2013353. Springer, Heidelberg (1997)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart-Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing\u00a014, 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","volume":"263","author":"G. Damiand","year":"2001","unstructured":"Damiand, G., Habib, M., Paul, C.: A simple paradigm for graph recognition: application to cographs and distance-hereditary graphs. Theoretical Computer Science\u00a0263, 99\u2013111 (2001)","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M.C. Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. of Algorithms\u00a019, 449\u2013473 (1995)","journal-title":"J. of Algorithms"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.dam.2003.12.009","volume":"143","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C., Lipshteyn, M.: Chordal probe graphs. Discrete Applied Mathematics\u00a0143, 221\u2013237 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2004.01.011","volume":"145","author":"M. Habib","year":"2005","unstructured":"Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics\u00a0145, 183\u2013197 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howorka","year":"1977","unstructured":"Howorka, E.: A characterization of distance-hereditary graphs. The Quarterly Journal of Mathematics\u00a028, 417\u2013420 (1977)","journal-title":"The Quarterly Journal of Mathematics"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/jagm.1999.1064","volume":"35","author":"S.-Y. Hsieh","year":"2000","unstructured":"Hsieh, S.-Y., Ho, C.-W., Hsu, T.-S., Ko, M.-T., Chen, G.-H.: A faster implementation of a parallel tree contraction scheme and its application on distance-hereditary graphs. Journal of Algorithms\u00a035, 50\u201381 (2000)","journal-title":"Journal of Algorithms"},{"key":"25_CR16","unstructured":"Johnson, J.L., Spinrad, J.: A polynomial-time recognition algorithm for probe interval graphs. In: Proceedings 12th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 477\u2013486 (2001)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"25_CR18","unstructured":"McConnell, R.M., Spinrad, J.: Construction of probe interval graphs. In: Proceedings 13th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 866\u2013875 (2002)"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0166-218X(98)00077-8","volume":"88","author":"F.R. McMorris","year":"1998","unstructured":"McMorris, F.R., Wang, C., Zhang, P.: On probe interval graphs. Discrete Applied Mathematics\u00a088, 315\u2013324 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR20","series-title":"Monographs in Theoretical Computer Science, an EATCS series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","year":"1984","unstructured":"Mehlhorn, Kurt: Data Structures and Algorithms 1: Sorting and Searching. Monographs in Theoretical Computer Science, an EATCS series, vol.\u00a01. Springer, Heidelberg (1984)"},{"key":"25_CR21","first-page":"33","volume":"140","author":"L. Sheng","year":"1999","unstructured":"Sheng, L.: Cycle-free probe interval graphs. Congressus Numerantium\u00a0140, 33\u201342 (1999)","journal-title":"Congressus Numerantium"},{"key":"25_CR22","first-page":"309","volume":"10","author":"P. Zhang","year":"1994","unstructured":"Zhang, P., Schon, E.A., Fisher, 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. CABIOS\u00a010, 309\u2013317 (1994)","journal-title":"CABIOS"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775096_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:39Z","timestamp":1619507679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775096_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351573","9783540351580"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11775096_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}