{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:09:37Z","timestamp":1778663377962,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,8]],"date-time":"2010-04-08T00:00:00Z","timestamp":1270684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9313-y","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T19:43:15Z","timestamp":1270669395000},"page":"640-650","source":"Crossref","is-referenced-by-count":2,"title":["Co-2-plex polynomials"],"prefix":"10.1007","volume":"22","author":[{"given":"Benjamin","family":"McClosky","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Simms","sequence":"additional","affiliation":[]},{"given":"Illya V.","family":"Hicks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,8]]},"reference":[{"key":"9313_CR1","first-page":"103","volume":"5","author":"JL Arocha","year":"1984","unstructured":"Arocha JL (1984) Propriedades del\u00a0polinomio independiente de\u00a0un grafo. Rev Cienc Mat 5:103\u2013110","journal-title":"Rev Cienc Mat"},{"key":"9313_CR2","doi-asserted-by":"crossref","unstructured":"Balasundaram B, Butenko S, Hicks IV (2010) Clique relaxations in social network analysis: the maximum k-plex problem. Oper Res, to appear","DOI":"10.1287\/opre.1100.0851"},{"key":"9313_CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.jctb.2004.10.001","volume":"93","author":"JI Brown","year":"2005","unstructured":"Brown JI, Nowakowski RJ (2005) Average independence polynomials. J\u00a0Comb Theory B 93:313\u2013318","journal-title":"J\u00a0Comb Theory B"},{"key":"9313_CR4","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1008705614290","volume":"11","author":"JI Brown","year":"2000","unstructured":"Brown JI, Dilcher K, Nowakowski RJ (2000) Roots of independence polynomials of well-covered graphs. J\u00a0Algebraic Comb 11:197\u2013210","journal-title":"J\u00a0Algebraic Comb"},{"key":"9313_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/B:JACO.0000030703.39946.70","volume":"19","author":"JI Brown","year":"2004","unstructured":"Brown JI, Hickman CA, Nowakowski RJ (2004) On the location of roots of independence polynomials. J\u00a0Algebraic Comb 19:273\u2013282","journal-title":"J\u00a0Algebraic Comb"},{"key":"9313_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko S, Wilhelm W (2006) Clique-detection models in computational biochemistry and genomics. Eur J Oper Res 173:1\u201317","journal-title":"Eur J Oper Res"},{"key":"9313_CR7","volume-title":"Clustering algorithms for ad hoc wireless networks, ad hoc and sensor networks","author":"YP Chen","year":"2004","unstructured":"Chen YP, Liestman AL, Liu J (2004) In: Pan Y, Xiao Y (eds) Clustering algorithms for ad hoc wireless networks, ad hoc and sensor networks. Nova Science Publishers, New York"},{"issue":"3","key":"9313_CR8","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.jctb.2006.06.001","volume":"97","author":"M Chudnovsky","year":"2007","unstructured":"Chudnovsky M, Seymour P (2007) The roots of the stable set polynomial of a claw-free graph. J\u00a0Comb Theory, Ser B 97(3):350\u2013357","journal-title":"J\u00a0Comb Theory, Ser B"},{"key":"9313_CR9","series-title":"Graduate texts in mathematics","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory. Graduate texts in mathematics, vol\u00a0173. Springer, Heidelberg"},{"key":"9313_CR10","doi-asserted-by":"crossref","unstructured":"Guo J, Komusiewicz C, Niedermeier R (2009) A more relaxed model for graph-based data clustering: s-plex editing. In: AAIM 2009, pp\u00a0226\u2013239","DOI":"10.1007\/978-3-642-02158-9_20"},{"issue":"64","key":"9313_CR11","first-page":"19","volume":"30","author":"I Gutman","year":"1991","unstructured":"Gutman I (1991) An identity for the independence polynomials of trees. Publ Inst Math 30(64):19\u201323","journal-title":"Publ Inst Math"},{"key":"9313_CR12","first-page":"139","volume":"28","author":"I Gutman","year":"1992","unstructured":"Gutman I (1992) Some analytical properties of independence and matching polynomials. Match 28:139\u2013150","journal-title":"Match"},{"key":"9313_CR13","first-page":"97","volume":"24","author":"I Gutman","year":"1983","unstructured":"Gutman I, Harary F (1983) Generalizations of the matching polynomial. Util Math 24:97\u2013106","journal-title":"Util Math"},{"key":"9313_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(94)90163-5","volume":"125","author":"C Hoede","year":"1994","unstructured":"Hoede C, Li X (1994) Clique polynomials and independent set polynomials of graphs. Discrete Math 125:219\u2013228","journal-title":"Discrete Math"},{"key":"9313_CR15","first-page":"101","volume":"139","author":"VE Levit","year":"1999","unstructured":"Levit VE, Mandrescu E (1999) Well-covered trees. Congr Numer 139:101\u2013112","journal-title":"Congr Numer"},{"key":"9313_CR16","first-page":"193","volume":"159","author":"VE Levit","year":"2002","unstructured":"Levit VE, Mandrescu E (2002) On well-covered trees with unimodal independence polynomials. Congr Numer 159:193\u2013202","journal-title":"Congr Numer"},{"key":"9313_CR17","unstructured":"Levit VE, Mandrescu E (2005) The independence polynomial of a graph\u2014a survey. In: Proceedings of the 1st international conference on algebraic informatics, Aristotle University of Thessaloniki, Greece, pp\u00a0233\u2013254"},{"issue":"4","key":"9313_CR18","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.dam.2006.06.016","volume":"156","author":"VE Levit","year":"2008","unstructured":"Levit VE, Mandrescu E (2008) On the roots of independence polynomials of almost all very well-covered graphs. Discrete Appl Math 156(4):478\u2013491","journal-title":"Discrete Appl Math"},{"key":"9313_CR19","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0166-218X(95)00121-7","volume":"58","author":"X Li","year":"1995","unstructured":"Li X, Gutman I (1995) A\u00a0unified approach of the first derivatives of graph polynomials. Discrete Appl Math 58:293\u2013297","journal-title":"Discrete Appl Math"},{"issue":"4","key":"9313_CR20","doi-asserted-by":"crossref","first-page":"S8","DOI":"10.1186\/1471-2105-10-S14-S8","volume":"10","author":"F Luo","year":"2009","unstructured":"Luo F, Li B, Wan XF, Scheuermann RH (2009) Core and periphery structures in protein interaction networks. BMC Bioinform 10(4):S8","journal-title":"BMC Bioinform"},{"issue":"3","key":"9313_CR21","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/070687414","volume":"23","author":"B McClosky","year":"2009","unstructured":"McClosky B, Hicks IV (2009) The co-2-plex polytope and integral systems. SIAM J Discrete Math 23(3):1135\u20131148","journal-title":"SIAM J Discrete Math"},{"key":"9313_CR22","first-page":"191","volume":"24","author":"R Rosenfeld","year":"1989","unstructured":"Rosenfeld R, Gutman I (1989) A\u00a0novel approach to graph polynomials. Match 24:191\u2013199","journal-title":"Match"},{"key":"9313_CR23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph theoretic generalization of the clique concept. J Math Soc 6:139\u2013154","journal-title":"J Math Soc"},{"issue":"1","key":"9313_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio T, Motoda H (2003) State of the art of graph-based data mining. SIGKDD Explorer Newsletter 5(1):59\u201368","journal-title":"SIGKDD Explorer Newsletter"},{"key":"9313_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge"},{"key":"9313_CR26","unstructured":"Wu B, Pei X (2009) A\u00a0parallel algorithm for enumerating all the maximal k-plexes. In: Emerging technologies in knowledge discovery and data mining. Lecture notes in computer science, vol\u00a04819, pp\u00a0476\u2013483"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9313-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9313-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9313-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:16Z","timestamp":1559276296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9313-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,8]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9313"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9313-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,8]]}}}