{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:59Z","timestamp":1759063799821},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0020-0190(93)90191-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"21-26","source":"Crossref","is-referenced-by-count":12,"title":["The edge Hamiltonian path problem is NP-complete for bipartite graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"Ten-Hwang","family":"Lai","sequence":"first","affiliation":[]},{"given":"Shu-Shang","family":"Wei","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90191-B_BIB1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","article-title":"The Edge Hamiltonian Path Problem is NP-complete","volume":"13","author":"Bertossi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90191-B_BIB2","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(93)90191-B_BIB3","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321850.321853","article-title":"An optimal algorithm to detect a line graph and output its root graph","volume":"21","author":"Lehot","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90191-B_BIB4","article-title":"Scheduling of page-fetches in join operations","author":"Merrett","year":"1981","journal-title":"Proc. 7th Internat. Conf. on Very Large Databases"},{"key":"10.1016\/0020-0190(93)90191-B_BIB5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/3148.3325","article-title":"Use of graph-theoretic models for optimal relational database accesses to perform join","volume":"10","author":"Pramanik","year":"1985","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0020-0190(93)90191-B_BIB6","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","article-title":"A max{m, n} algorithm for determining the graph H from its line graph G","volume":"2","author":"Roussopoulos","year":"1973","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390191B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390191B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:44Z","timestamp":1555132904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390191B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["002001909390191B"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90191-b","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}