{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:14:56Z","timestamp":1729624496254,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/dmo.2009.5341909","type":"proceedings-article","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T19:44:08Z","timestamp":1260301448000},"page":"65-70","source":"Crossref","is-referenced-by-count":7,"title":["A note on the P-time algorithms for solving the maximum independent set problem"],"prefix":"10.1109","author":[{"given":"Navid Nasr","family":"Esfahani","sequence":"first","affiliation":[]},{"given":"Parisa","family":"Mazrooei","sequence":"additional","affiliation":[]},{"given":"Kaveh","family":"Mahdaviani","sequence":"additional","affiliation":[]},{"given":"Behnaz","family":"Omoomi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"11","first-page":"207","article-title":"optimal parallel algorithms for the recognition and coloring outerplanar graphs","volume":"379","author":"diks","year":"1989","journal-title":"LNCS"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85238-4_7"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.915645"},{"year":"0","key":"2"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.15807\/jorsj.44.194","article-title":"a revision of minty's algorithm for finding a maximum weight stable set of a claw-free graph","volume":"44","author":"nakamura","year":"2001","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_74"},{"key":"7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"algorithme de recherche d'un independent de cardinalite maximum dans un graphe sans etoile","volume":"29","author":"sbihi","year":"1980","journal-title":"Discrete Mathematics"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90074-X"},{"key":"5","first-page":"69","article-title":"graph theory and combinatorial optimization","author":"hertz","year":"2005","journal-title":"Springer"},{"journal-title":"Introduction to Graph Theory","year":"2001","author":"west","key":"4"},{"key":"9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(02)00290-1","article-title":"a polynomial algorithm for finding the largest independent sets in fork-free graphs","volume":"135","author":"alekseev","year":"2004","journal-title":"Discrete Applied Mathematics"},{"key":"8","article-title":"matching theory","author":"lova?sz","year":"1986","journal-title":"Ann Discrete Math"}],"event":{"name":"2009 2nd Conference on Data Mining and Optimization","start":{"date-parts":[[2009,10,27]]},"location":"Kajand, Malaysia","end":{"date-parts":[[2009,10,28]]}},"container-title":["2009 2nd Conference on Data Mining and Optimization"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5340228\/5341891\/05341909.pdf?arnumber=5341909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T10:27:22Z","timestamp":1558693642000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5341909\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/dmo.2009.5341909","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}