{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:34:40Z","timestamp":1783150480152,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280613","type":"print"},{"value":"9783540318064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_82","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"808-817","source":"Crossref","is-referenced-by-count":10,"title":["On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs"],"prefix":"10.1007","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"82_CR1","doi-asserted-by":"crossref","unstructured":"Berge, C., Chvatal, C. (eds.): Topics on Perfect Graphs. Annals of Discrete Mathematics, vol. 21 (1984)","DOI":"10.1016\/S0304-0208(08)72921-9"},{"key":"82_CR2","doi-asserted-by":"crossref","unstructured":"Br\u00e4ndstadt, A., Le, V.B., Spinrad, J.P.: Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"82_CR3","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\u2014a floor show of minimal separators. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 521\u2013532. Springer, Heidelberg (2005) (to appear)"},{"key":"82_CR4","unstructured":"Chudnovsky, M., Seymour, P., Robertson, N., Thomas, R.: The strong perfect graph theorem (2002) (manuscript)"},{"key":"82_CR5","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":"82_CR6","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":"82_CR7","unstructured":"G\u00e9rard, C., Liu, X., Vu\u0161kovi\u0107, K.: A polynomial algorithm for recognizing perfect graphs. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003 (2003)"},{"key":"82_CR8","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":"82_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-39890-5_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.C. Golumbic","year":"2003","unstructured":"Golumbic, M.C., Lipshsteyn, M.: Chordal probe graphs (extended abstract). In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 249\u2013260. Springer, Heidelberg (2003)"},{"key":"82_CR10","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs. Cambridge studies in advanced mathematics, vol. 89 (2004)","DOI":"10.1017\/CBO9780511542985"},{"key":"82_CR11","unstructured":"Gr\u00f6tschel, M.: Characterizations of perfect graphs. Mathematical Programming Society Newsletter 62 (1999)"},{"key":"82_CR12","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":"82_CR13","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"R.B. Hayward","year":"1985","unstructured":"Hayward, R.B.: Weakly triangulated graphs. Journal of Combinatorial Theory, series B\u00a039, 200\u2013208 (1985)","journal-title":"Journal of Combinatorial Theory, series B"},{"key":"82_CR14","unstructured":"Ho\u00e0ng, C.T.: Perfect graphs, PhD thesis, School of Computer Science, McGill University, Montreal (1985)"},{"key":"82_CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison, B., Olariu, S.: P4-reducible graphs\u2014a class of uniquely tree representable graphs. Studies in Appl. Math.\u00a081, 79\u201387 (1989)","journal-title":"Studies in Appl. Math."},{"key":"82_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: A unique tree representation for P4-sparse graphs. Discrete Applied Mathematics\u00a035, 115\u2013129 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"82_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1137\/0221027","volume":"21","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: Recognizing P4-sparse graphs in linear time. SIAM Journal on Computing\u00a021, 381\u2013406 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"82_CR18","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":"82_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: A characterization of perfect graphs. Journal of Combinatorial Theory Series B\u00a013, 95\u201398 (1972)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"82_CR20","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":"82_CR21","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":"82_CR22","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"82_CR23","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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:37:29Z","timestamp":1586471849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11533719_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}