{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:29Z","timestamp":1725643589923},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003878"},{"type":"electronic","value":"9783642555374"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-642-55537-4_63","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T15:12:30Z","timestamp":1323961950000},"page":"389-394","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Some Problems on Maximal Independent Sets in Graphs"],"prefix":"10.1007","author":[{"given":"Igor","family":"Zverovich","sequence":"first","affiliation":[]},{"given":"Yury","family":"Orlovich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0167-5060(08)70387-X","volume":"55","author":"V Chv\u00e1tal","year":"1993","unstructured":"Chvatal, V., Slater, P. J. (1993) A note on well-covered graphs. Ann. Discrete Math. 55, 179\u2013182","journal-title":"Discrete Math"},{"key":"63_CR2","volume-title":"Computers and Intractability.","author":"MR Garey","year":"1979","unstructured":"Garey M. R., Johnson D. S. (1979) Computers and Intractability. W. H. Freeman and Company, San Francisco"},{"key":"63_CR3","doi-asserted-by":"crossref","unstructured":"Harary F. (1969) Graph Theory. Addison-Wesley","DOI":"10.21236\/AD0705364"},{"key":"63_CR4","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"RB Hayward","year":"1985","unstructured":"Hayward, R. B. (1985) Weakly trianqulated graphs. J. Comb. Theory. Ser. B 39200\u2013208","journal-title":"J. Comb. Theory. Ser. B"},{"key":"63_CR5","first-page":"265","volume-title":"Survey on counting maximal independent sets. Proc. Second Asian Math","author":"M-J Jou","year":"1995","unstructured":"Jou, M.-J., Chang, G. J. (1995) Survey on counting maximal independent sets. Proc. Second Asian Math. Conf World Scientific, Singapore, 265\u2013275"},{"key":"63_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF01858464","volume":"12","author":"M-J Jou","year":"1996","unstructured":"Jou, M.-J., Chang, G. J., Lin, C., Ma, T.-H. (1996) A finiteness theorem for maximal independent sets. Graphs and Combin. 12, 321\u2013326","journal-title":"Graphs and Combin"},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0012-365X(93)90512-R","volume":"113","author":"K McAvaney","year":"1993","unstructured":"McAvaney, K., Robertson, J., DeTemple, D. (1993) A characterization and hereditary properties for partition graphs. Discrete Math. 113, 131\u2013142","journal-title":"Discrete Math"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J. W., Moser, L. (1965) On cliques in graphs. Israel J. Math. 3, 23\u201328","journal-title":"Israel J. Math"}],"container-title":["Operations Research Proceedings 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55537-4_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T22:47:48Z","timestamp":1555886868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55537-4_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540003878","9783642555374"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55537-4_63","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}