{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:52Z","timestamp":1725663292018},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:06:21Z","timestamp":1330203981000},"page":"267-290","source":"Crossref","is-referenced-by-count":2,"title":["Linear algorithms for parity path and two path problems on circular-arc graph"],"prefix":"10.1007","author":[{"given":"A.","family":"Srinivasa Rao","sequence":"first","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0020-0190(87)90007-X","volume":"26","author":"A. Apostolico","year":"1987","unstructured":"A. Apostolico and S.E. Hambrusch, Finding Maximum Cligues On Circular-arc Graphs, Infom. Proc. Lett., 26(1987), pp.209\u2013215.","journal-title":"Infom. Proc. Lett."},{"key":"24_CR2","volume-title":"Efficient Sequential and Parallel Algorithms on Interval and Circular-arc Graphs","author":"A. Srinivasa Rao","year":"1989","unstructured":"A. Srinivasa Rao, Efficient Sequential and Parallel Algorithms on Interval and Circular-arc Graphs, M.S. Thesis, Dept. of Computer Science and Engg, Indian Inst of Tech, Madras, India, 1989."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","volume":"12","author":"M. A. Bonuccelli","year":"1985","unstructured":"M.A. Bonuccelli, Dominating Sets And Domatic Number Of Circular-arc Graphs, Discrete Appl. Math., 12(1985), pp.203\u2013213.","journal-title":"Discrete Appl. Math."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"G.A. Cypher, The k Paths Problem, Ph.D. Dissertation, Yale University, 1980.","DOI":"10.1145\/800141.804668"},{"key":"24_CR5","volume-title":"Algorithmic Graph Theory And Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory And Perfect Graphs (Academic press, New York, 1980)"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P. C. Gilmore","year":"1964","unstructured":"P.C. Gilmore and A.J. Hoffman, A Characterization Of Comparability Graphs And Interval Graphs, Canad.J.Math., 16(1964), pp.539\u2013548.","journal-title":"Canad.J.Math."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","volume":"9","author":"M. C. Golumbic","year":"1988","unstructured":"M.C. Golumbic and Peter L. Hammer, Stability In Circulararc Graphs, J. Algorithms, 9(1988), pp.314\u2013320.","journal-title":"J. Algorithms"},{"key":"24_CR8","volume-title":"Computers and Intractability: A Guide To The Theory Of NP-Completeness","author":"M. R. Gary","year":"1979","unstructured":"M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide To The Theory Of NP-Completeness (Freeman, San Francisco, CA, 1979)."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/0214018","volume":"14","author":"W. Hsu","year":"1985","unstructured":"Wen-Lian Hsu, Maximum Weight Clique Algorithms For Circular-arc Graphs And Circle Graphs, SIAM J. Comput., 14(1985), pp.224\u2013231.","journal-title":"SIAM J. Comput."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/23005.31330","volume":"34","author":"W. Hsu","year":"1987","unstructured":"Wen-Lian Hsu, Recognising Planar Perfect Graphs, J. Assoc. Comput. Mach., 34(1987), pp.255\u2013288.","journal-title":"J. Assoc. Comput. Mach."},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","volume":"20","author":"J. M. Keil","year":"1985","unstructured":"J.M. Keil, Finding Hamiltonian Circuits In Interval Graphs, Inform. Proc. Lett., 20(1985), pp. 201\u2013206.","journal-title":"Inform. Proc. Lett."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"S.V. Krishnan, Seshadri and C. Pandu Rangan, A new Linear Algorithm For The Two Path Problem On Chordal Graphs, Eighth International Conference on Foundations of Software Technology & Theoretical Computer Science, Pune, India, Dec 21\u201323, 1988.","DOI":"10.1007\/3-540-50517-2_70"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/0217003","volume":"17","author":"S. Masuda","year":"1988","unstructured":"S. Masuda and K. Nakajima, An Optimal Algorithm For Finding a Maximum Independent Set Of a Circular-arc Graph, SIAM J. Comput., 17(1988), pp.41\u201352.","journal-title":"SIAM J. Comput."},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Perl","year":"1978","unstructured":"Y. Perl and Y. Shiloach, Finding Two Disjoint Paths Between Two Pairs Of Vertices In a Graph, J. Assoc. Comput. Mach., 25(1978), pp.1\u20139.","journal-title":"J. Assoc. Comput. Mach."},{"key":"24_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G. Ramalingam","year":"1988","unstructured":"G. Ramalingam and C. Pandu Rangan, A Unified Approach To Domination Problems On Interval Graphs, Inform. Proc. Lett., 27(1988), pp.271\u2013274.","journal-title":"Inform. Proc. Lett."},{"key":"24_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Y. Shiloach, A Polynomial Solution To The Undirected Two Path Problem, J. Assoc. Comput. Mach., 27(1980), pp.445\u2013456.","journal-title":"J. Assoc. Comput. Mach."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A. Tucker","year":"1980","unstructured":"A. Tucker, An Efficient Test For Circular-arc Graphs, SIAM J. Comput., 9(1980), pp.1\u201324.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:54Z","timestamp":1605648114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}