{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:48:57Z","timestamp":1752461337970,"version":"3.33.0"},"reference-count":22,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1080\/00207169908804777","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:23:09Z","timestamp":1182817389000},"page":"587-599","source":"Crossref","is-referenced-by-count":11,"title":["An efficient algorithm to generate all maximal independent sets on trapezoid graphs"],"prefix":"10.1080","volume":"70","author":[{"given":"Marinmoy","family":"Hota","sequence":"first","affiliation":[]},{"given":"Madhumangal","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Tapan K.","family":"Pal","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90114-B"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00158-A"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90032-7"},{"key":"CIT0004","first-page":"139","volume":"318","author":"Dahlhaus E.","year":"1988","journal-title":"First Scandinavian Workshop on Algorithm Theory"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Gabor, C.P., Hsu, W.L. and Supowit, K.J. Recognizing circle graphs in polynomial time. Proc:26th IEEE FOCS. pp.106\u2013116.","DOI":"10.1109\/SFCS.1985.47"},{"volume-title":"Algorithmic Graph Theory and Perfect Graphs","year":"1980","author":"Golumbic M.C.","key":"CIT0006"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90178-0"},{"key":"CIT0008","first-page":"372","volume":"497","author":"Kirsch E.S.","year":"1991","journal-title":"Advances in Computing and Information"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"Klein, P.N. Efficient parallel algorithms for chordal graphs. Proc:29th IEEE FOCS. pp.150\u2013161.","DOI":"10.1109\/SFCS.1988.21933"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90037-3"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00159-6"},{"volume-title":"Efficient enumeration of maximal and maximum independent sets of an interval graph and a circular-arc graph","year":"1987","author":"Masuda S.","key":"CIT0012"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1034"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1137\/0218023"},{"key":"CIT0015","first-page":"29","volume-title":"J. Institution of Engineer","volume":"76","author":"Pal M.","year":"1995"},{"volume-title":"Some Sequential and Parallel Algorithms on Interval Graphs","year":"1995","author":"Pal M.","key":"CIT0016"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1080\/00207169608804486"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1080\/00207169808804664"},{"volume-title":"An efficient algorithm to compute a maximum weight k-independent set on Permutation graphs, Communicated.","author":"Pal M.","key":"CIT0019"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110305"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1080\/00207169308804157"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169908804777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T21:40:26Z","timestamp":1737150026000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169908804777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["10.1080\/00207169908804777"],"URL":"https:\/\/doi.org\/10.1080\/00207169908804777","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"type":"print","value":"0020-7160"},{"type":"electronic","value":"1029-0265"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}