{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:00:39Z","timestamp":1725552039536},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_47","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"494-504","source":"Crossref","is-referenced-by-count":3,"title":["On Probe Permutation 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":"Antonius J. J.","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":"47_CR1","unstructured":"Berry, A., Golumbic, M.C., Lipshteyn, M.: Two tricks to triangulate chordal probe graphs in polynomial time. In: Proceedings of the 15th. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 962\u2013969 (2004)"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/S089548019223992X","volume":"8","author":"H. Bodlaender","year":"1995","unstructured":"Bodlaender, H., Kloks, T., Kratsch, D.: Treewidth and Pathwidth of permutation graphs. SIAM Journal on Discrete Mathematics\u00a08, 606\u2013616 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V. Bouchitte","year":"2001","unstructured":"Bouchitte, V., Todinca, I.: Treewidth and minimum fill-in: Grouping the minimal separators. SIAM Journal on Computing\u00a031, 212\u2013232 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR5","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":"47_CR6","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)"},{"key":"47_CR7","unstructured":"Cowan, D.D., James, L.O., Stanton, R.G.: Graph decomposition for undirected graphs. In: 3rd South-Eastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Math pp. 281\u2013290 (1972)"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Sci. Hung.\u00a018, 25\u201366 (1967)","journal-title":"Acta Math. Sci. Hung."},{"key":"47_CR9","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":"47_CR10","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., Lipshsteyn, M.: Chordal probe graphs. Discrete Applied Mathematics\u00a0143, 221\u2013237 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"47_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs, Cambridge studies in advanced mathematics","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs, Cambridge studies in advanced mathematics. Cambridge University Press, Cambridge (2004)"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-27810-8_17","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Habib","year":"2004","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm for graphs, using order extensions. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01788666","volume":"5","author":"A. Hertz","year":"1989","unstructured":"Hertz, A.: Slim graphs. Graphs and Combinatorics\u00a05, 149\u2013157 (1989)","journal-title":"Graphs and Combinatorics"},{"key":"47_CR14","unstructured":"Johnson, J.L., Spinrad, J.P.: A polynomial time recognition algorithm for probe interval graphs. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms 2001, pp. 477\u2013486 (2001)"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Kelly, D.: Comparability graphs. In: Rival, I. (ed.) Graphs and Orders, pp. 3\u201340 D. Reidel Pub. Comp (1985)","DOI":"10.1007\/978-94-009-5315-4_1"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T. Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D.: Listing all minimal separators of a graph. SIAM Journal on Computing\u00a027, 605\u2013613 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"47_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":"47_CR18","unstructured":"McConnell, R.M., Spinrad, J.: Construction of probe interval graphs. In: Proceedings 13th ACM\u2013SIAM Symposium on Discrete Algorithms 2002, pp. 866\u2013875 (2002)"},{"key":"47_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":"47_CR20","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Orders, pp. 41\u2013101 D. Reidel Pub. Comp. (1985)","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"47_CR21","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Mathematics"},{"key":"47_CR22","doi-asserted-by":"publisher","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Canad. J. Math.\u00a023, 160\u2013175 (1971)","journal-title":"Canad. J. Math."},{"key":"47_CR23","unstructured":"Zhang, P.: Probe interval graphs and their application to physical mapping of DNA. Manuscript (1994)"},{"key":"47_CR24","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","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:41Z","timestamp":1619506601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11750321_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}