{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:04Z","timestamp":1725551404226},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121647"},{"type":"electronic","value":"9783642121654"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12165-4_25","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T17:04:35Z","timestamp":1270055075000},"page":"314-323","source":"Crossref","is-referenced-by-count":0,"title":["Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs"],"prefix":"10.1007","author":[{"given":"Ruo-Wei","family":"Hung","sequence":"first","affiliation":[]},{"given":"Maw-Shang","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(90)90064-5","volume":"35","author":"S.R. Arikati","year":"1990","unstructured":"Arikati, S.R., Rangan, C.: Pandu: Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. Inform. Process. Lett.\u00a035, 149\u2013153 (1990)","journal-title":"Inform. Process. Lett."},{"key":"25_CR2","unstructured":"Ascheuer, N.: Hamiltonian Path Problems in the On-Line Optimization of Flexible Manufacturing Systems. Technique Report TR 96-3, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin (1996)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/322003.322005","volume":"24","author":"F.T. Boesch","year":"1977","unstructured":"Boesch, F.T., Gimpel, J.F.: Covering the Points a Digraph with Point-Disjoint Paths and its Application to Code Optimization. J. ACM\u00a024, 192\u2013198 (1977)","journal-title":"J. ACM"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, New York (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1097-0037(199908)34:1<1::AID-NET1>3.0.CO;2-C","volume":"34","author":"M.S. Chang","year":"1999","unstructured":"Chang, M.S., Peng, S.L., Liaw, J.L.: Deferred-Query: an Efficient Approach for Some Problems on Interval Graphs. Networks\u00a034, 1\u201310 (1999)","journal-title":"Networks"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2007.12.009","volume":"107","author":"F.P.M. Chu","year":"2008","unstructured":"Chu, F.P.M.: A Simple Linear Time Certifying LBFS-Based Algorithm for Recognizing Trivially Perfect Graphs and their Complements. Inform. Process. Lett.\u00a0107, 7\u201312 (2008)","journal-title":"Inform. Process. Lett."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough Graphs and Hamiltonian Circuits. Discrete Math.\u00a05, 215\u2013228 (1973)","journal-title":"Discrete Math."},{"key":"25_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics\u00a057 (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"25_CR10","first-page":"87","volume":"14","author":"P. Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-Time Certifying Algorithms for Recognizing Split Graphs and Related Graph Classes. Nordic J. Comput.\u00a014, 87\u2013108 (2007)","journal-title":"Nordic J. Comput."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/S0895480103430259","volume":"18","author":"P. Hell","year":"2005","unstructured":"Hell, P., Huang, J.: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs. SIAM J. Discrete Math.\u00a018, 554\u2013570 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"H.A. Jung","year":"1978","unstructured":"Jung, H.A.: On a Class of Posets and the Corresponding Comparability Graphs. J. Combin. Theory Ser. B\u00a024, 125\u2013133 (1978)","journal-title":"J. Combin. Theory Ser. B"},{"key":"25_CR13","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 158\u2013167 (2003)"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0097539703437855","volume":"36","author":"D. Kratsch","year":"2006","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying Algorithms for Recognizing Interval Graphs and Permutation graphs. SIAM J. Comput.\u00a036, 326\u2013353 (2006)","journal-title":"SIAM J. Comput."},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(90)90025-S","volume":"35","author":"G.K. Manacher","year":"1990","unstructured":"Manacher, G.K., Mankus, T.A., Smith, C.J.: An Optimum \u0398(nlogn) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. Inform. Process. Lett.\u00a035, 205\u2013211 (1990)","journal-title":"Inform. Process. Lett."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TSE.1979.234213","volume":"5","author":"S.C. Ntafos","year":"1979","unstructured":"Ntafos, S.C., Louis Hakimi, S.: On Path Cover Problems in Digraphs and Applications to Program Testing. IEEE Trans. Software Engrg.\u00a05, 520\u2013529 (1979)","journal-title":"IEEE Trans. Software Engrg."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01408172","volume":"16","author":"S. Pinter","year":"1987","unstructured":"Pinter, S., Wolfstahl, Y.: On Mapping Processes to Processors. Internat. J. Parallel Programming\u00a016, 1\u201315 (1987)","journal-title":"Internat. J. Parallel Programming"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1137\/0221061","volume":"21","author":"W.K. Shih","year":"1992","unstructured":"Shih, W.K., Chern, T.C., Hsu, W.L.: An O(n 2logn) Time Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs. SIAM J. Comput.\u00a021, 1026\u20131046 (1992)","journal-title":"SIAM J. Comput."},{"key":"25_CR19","unstructured":"Toussaint, G.T.: Pattern Recognition and Geometrical Complexity. In: Proceedings of the 5th International Conference on Pattern Recognition, Miami Beach, pp. 1324\u20131347 (1980)"},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02460022","volume":"48","author":"M.S. Waterman","year":"1986","unstructured":"Waterman, M.S., Griggs, J.R.: Interval Graphs and Maps of DNA. Bull. Math. Biol.\u00a048, 189\u2013195 (1986)","journal-title":"Bull. Math. Biol."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12165-4_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:50:21Z","timestamp":1606186221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12165-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121647","9783642121654"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12165-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}