{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:09:27Z","timestamp":1648818567673},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0166-218x(95)00086-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"5-20","source":"Crossref","is-referenced-by-count":11,"title":["A polynomial algorithm for the parity path problem on perfectly orientable graphs"],"prefix":"10.1016","volume":"65","author":[{"given":"Srinivasa R.","family":"Arikati","sequence":"first","affiliation":[]},{"given":"Uri N.","family":"Peled","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00086-7_BIB1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(93)90230-L","article-title":"A linear algorithm for the group path problem on chordal graphs","volume":"44","author":"Arikati","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00086-7_BIB2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF01931279","article-title":"Efficient reduction for path problems on circular-arc graphs","volume":"31","author":"Arikati","year":"1991","journal-title":"BIT"},{"key":"10.1016\/0166-218X(95)00086-7_BIB3","series-title":"Topics on Perfect Graphs","volume":"21","year":"1984"},{"key":"10.1016\/0166-218X(95)00086-7_BIB4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","article-title":"On the complexity of testing for odd holes and induced odd paths","volume":"90","author":"Bienstock","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00086-7_BIB5","series-title":"Topics on Perfect Graphs","first-page":"63","article-title":"Perfectly orderable graphs","volume":"21","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0166-218X(95)00086-7_BIB6","article-title":"Avoiding obstructions in graph orientations","author":"Gavril","year":"1991"},{"key":"10.1016\/0166-218X(95)00086-7_BIB7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1006\/jagm.1994.1031","article-title":"Chordless paths, odd holes, and kernels in graphs without m--obstructions","volume":"17","author":"Gavril","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(95)00086-7_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(95)00086-7_BIB9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/23005.31330","article-title":"Recognizing planar perfect graphs","volume":"34","author":"Hsu","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)00086-7_BIB10","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/net.3230140403","article-title":"The even path problem for graphs and digraphs","volume":"14","author":"Lapaugh","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(95)00086-7_BIB11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(88)90125-4","article-title":"A note on odd\/even cycles","volume":"22","author":"Lubiw","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00086-7_BIB12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(90)90251-C","article-title":"On the complexity of recognizing perfectly orderable graphs","volume":"80","author":"Middendorf","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00086-7_BIB13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95000867?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95000867?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T12:22:46Z","timestamp":1555590166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X95000867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0166218X95000867"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00086-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}