{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:19:03Z","timestamp":1725495543546},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404521"},{"type":"electronic","value":"9783540450283"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45028-9_15","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T17:49:43Z","timestamp":1194976183000},"page":"166-177","source":"Crossref","is-referenced-by-count":1,"title":["Graph Polynomials, Principal Pivoting, and Maximum Independent Sets"],"prefix":"10.1007","author":[{"given":"Roland","family":"Glantz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"15_CR1","series-title":"Technical Report","volume-title":"The Interlace Polynomial: A New Graph Polynomial","author":"R. Arratia","year":"2000","unstructured":"R. Arratia, B. Bollob\u00e1s, and G. B. Sorkin. The Interlace Polynomial: A New Graph Polynomial. Technical Report RC 21813 (98165), IBM T.J. Watson Reserch Center, Yorktown Heights NY, July 2000."},{"key":"15_CR2","unstructured":"R. Arratia, B. Bollob\u00e1s, and G. B. Sorkin. The Interlace Polynomial: A New Graph Polynomial. In Proceeding of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 237\u2013245, San Francisco, CA, January 2000."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization (Suppl. Vol. A), pages 1\u201374. Kluwer, Boston, MA, 1999.","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"15_CR4","volume-title":"The Linear Complementarity Problem","author":"R. W. Cottle","year":"1992","unstructured":"R. W. Cottle, J.-S. Pang, and R. E. Stone. The Linear Complementarity Problem. Accademic Press, Boston, MA, 1992."},{"key":"15_CR5","series-title":"Technical Report","volume-title":"Graph polynomials from principal pivoting","author":"R. Glantz","year":"2003","unstructured":"R. Glantz and M. Pelillo. Graph polynomials from principal pivoting. Technical Report CS-2003-2, Dipartimento di Informatica, Universit\u00e0 Ca\u2019 Foscari di Venezia, 30172 Venezia Mestre (VE), Italy, 2003."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/S0167-8655(02)00256-8","volume":"24","author":"A. Massaro","year":"2003","unstructured":"A. Massaro and M. Pelillo. Matching graphs by pivoting. Pattern Recognition Letters, 24:1099\u20131106, 2003.","journal-title":"Pattern Recognition Letters"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1137\/S1052623400381413","volume":"12","author":"A. Massaro","year":"2002","unstructured":"A. Massaro, M. Pelillo, and I. M. Bomze. A complementary pivoting approach to the maximum weight clique problem. SIAM Journal on Optimization, 12(4):928\u2013948, 2002.","journal-title":"SIAM Journal on Optimization"},{"key":"15_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative combinatorics","author":"R. Stanley","year":"1986","unstructured":"R. Stanley. Enumerative combinatorics, Volume 1. Wadsworth and Brooks-Cole, Monterey, CA, 1986."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0024-3795(99)00281-5","volume":"307","author":"M. J. Tsatsomeros","year":"2000","unstructured":"M. J. Tsatsomeros. Principal pivot transforms: Properties and applications. Linear Algebra and Its Applications, 307:151\u2013165, 2000.","journal-title":"Linear Algebra and Its Applications"}],"container-title":["Lecture Notes in Computer Science","Graph Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45028-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T02:49:20Z","timestamp":1551062960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45028-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404521","9783540450283"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45028-9_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}