{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:56:05Z","timestamp":1742928965927,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_29","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"286-290","source":"Crossref","is-referenced-by-count":0,"title":["Recognition of Probe Ptolemaic Graphs"],"prefix":"10.1007","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[]},{"given":"Ling-Ju","family":"Hung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.J. Bandelt","year":"1986","unstructured":"Bandelt, H.J., Mulder, H.M.: Distance-hereditary graphs. Journal of Combinatorial Theory, Series B\u00a041, 182\u2013208 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"4812","DOI":"10.1016\/j.tcs.2009.06.029","volume":"410","author":"D. Bayer","year":"2009","unstructured":"Bayer, D., Le, V.B., de Ridder, H.N.: Probe threshold and probe trivially perfect graphs. Theoretical Computer Science\u00a0410, 4812\u20134822 (2009)","journal-title":"Theoretical Computer Science"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/050637091","volume":"21","author":"A. Berry","year":"2007","unstructured":"Berry, A., Golumbic, M.C., Lipshteyn, M.: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discrete Math.\u00a021, 573\u2013591 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11775096_25","volume-title":"Algorithmic Aspects in Information and Management","author":"D.B. Chandler","year":"2006","unstructured":"Chandler, D.B., Chang, M.-S., Kloks, T., Liu, J., Peng, S.-L.: Recognition of probe cographs and partitioned probe distance hereditary graphs. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 267\u2013278. Springer, Heidelberg (2006)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-540-72870-2_35","volume-title":"Algorithmic Aspects in Information and Management","author":"D.B. Chandler","year":"2007","unstructured":"Chandler, D.B., Guo, J., Kloks, T., Niedermeier, R.: Probe matrix problems: totally balanced matrices. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 368\u2013377. Springer, Heidelberg (2007)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.tcs.2008.01.038","volume":"396","author":"D.B. Chandler","year":"2008","unstructured":"Chandler, D.B., Chang, M.-S., Kloks, T., Liu, J., Peng, S.-L.: Partitioned probe comparability graphs. Theoretical Computer Science\u00a0396, 212\u2013222 (2008)","journal-title":"Theoretical Computer Science"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1016\/j.dam.2008.08.017","volume":"157","author":"D.B. Chandler","year":"2009","unstructured":"Chandler, D.B., Chang, M.-S., Kloks, A.J.J., Liu, J., Peng, S.-L.: On probe permutation graphs. Discrete Applied Mathematics\u00a0157, 2611\u20132619 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR8","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":"G.J. Chang","year":"2005","unstructured":"Chang, G.J., 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":"29_CR9","unstructured":"Chang, M.-S., Hung, L.-J., Rossmanith, P.: Probe bipartite distance-hereditary graphs. In: Proceedings of NCS 2009: Workshop on Algorithms and Bioinformatics, pp. 16\u201327 (2009)"},{"key":"29_CR10","unstructured":"Chang, M.-S., Hung, L.-J., Rossmanith, P.: Probe distance-hereditary graphs. In: Proceedings of CATS 2010. CRPIT, vol.\u00a0109, pp. 55\u201364 (2010)"},{"key":"29_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. Journal of Algorithms\u00a019, 449\u2013473 (1995)","journal-title":"Journal of Algorithms"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/jgt.3190050314","volume":"5","author":"E. Howorka","year":"1981","unstructured":"Howorka, E.: A characterization of ptolemaic graphs. Journal of Graph Theory\u00a05, 323\u2013331 (1981)","journal-title":"Journal of Graph Theory"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-74839-7_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V.B. Le","year":"2007","unstructured":"Le, V.B., de Ridder, H.N.: Characterisations and linear-time recognition of probe cographs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 226\u2013237. Springer, Heidelberg (2007)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-04128-0_32","volume-title":"Algorithms - ESA 2009","author":"R.M. McConnell","year":"2009","unstructured":"McConnell, R.M., Nussbaum, Y.: Linear-time recognition of probe interval graphs. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 349\u2013360. Springer, Heidelberg (2009)"},{"key":"29_CR15","first-page":"309","volume":"10","author":"P.E. Zhang","year":"1994","unstructured":"Zhang, P.E., Schon, A., Fischer, S.G., Cayanis, E., Weiss, J., Kistler, S., Bourne, 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","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:21:11Z","timestamp":1578532871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_29"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}