{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:10:37Z","timestamp":1742991037693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319573502"},{"type":"electronic","value":"9783319573519"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57351-9_25","type":"book-chapter","created":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T11:08:53Z","timestamp":1491822533000},"page":"203-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Knowledge Discovery in Graphs Through Vertex Separation"],"prefix":"10.1007","author":[{"given":"Marc","family":"Sarfati","sequence":"first","affiliation":[]},{"given":"Marc","family":"Queudot","sequence":"additional","affiliation":[]},{"given":"Catherine","family":"Mancel","sequence":"additional","affiliation":[]},{"given":"Marie-Jean","family":"Meurs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,11]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-005-0574-7","volume":"103","author":"E Balas","year":"2005","unstructured":"Balas, E., de Souza, C.: The vertex separator problem: a polyhedral investigation. Math. Program. 103(3), 583\u2013608 (2005)","journal-title":"Math. Program."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Benlic, U., Hao, J.K.: Breakout local search for the vertex separator problem. In: IJCAI (2013)","DOI":"10.1016\/j.amc.2012.10.106"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"TN Bui","year":"1992","unstructured":"Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42(3), 153\u2013159 (1992)","journal-title":"Inf. Process. Lett."},{"key":"25_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"TA Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems, vol. 2. SIAM, Philadelphia (2006)"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10898-010-9568-y","volume":"49","author":"M Didi Biha","year":"2011","unstructured":"Didi Biha, M., Meurs, M.J.: An exact algorithm for solving the vertex separator problem. J. Glob. Optim. 49(3), 425\u2013434 (2011)","journal-title":"J. Glob. Optim."},{"issue":"05","key":"25_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1142\/S0218195908002696","volume":"18","author":"B Fu","year":"2008","unstructured":"Fu, B., Oprisan, S.A., Xu, L.: Multi-directional width-bounded geometric separator and protein folding. Int. J. Comput. Geom. Appl. 18(05), 389\u2013413 (2008)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.7155\/jgaa.00130","volume":"10","author":"J Fukuyama","year":"2006","unstructured":"Fukuyama, J.: NP-completeness of the planar separator problems. J. Graph Algorithms Appl. 10(2), 317\u2013328 (2006)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR8","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W.H. Freeman, New York (2002)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.ejor.2014.05.042","volume":"240","author":"WW Hager","year":"2015","unstructured":"Hager, W.W., Hungerford, J.T.: Continuous quadratic programming formulations of optimization problems on graphs. Eur. J. Oper. Res. 240(2), 328\u2013337 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR10","unstructured":"Kanevsky, A.: Finding all minimum size separating vertex sets in a graph. Coordinated Science Laboratory Report no. ACT-93 (UJLU-ENG 88\u20132233) (1988)"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Schuchard, M., Geddes, J., Thompson, C., Hopper, N.: Routing around decoys. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 85\u201396. ACM (2012)","DOI":"10.1145\/2382196.2382209"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10107-005-0573-8","volume":"103","author":"C Souza de","year":"2005","unstructured":"de Souza, C., Balas, E.: The vertex separator problem: algorithms and computations. Math. Program. 103(3), 609\u2013631 (2005)","journal-title":"Math. Program."},{"key":"25_CR15","volume-title":"Computational Aspects of VLSI","author":"JD Ullman","year":"1984","unstructured":"Ullman, J.D.: Computational Aspects of VLSI. Computer Science Press, Rockville (1984)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57351-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:06:55Z","timestamp":1558318015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57351-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319573502","9783319573519"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57351-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Canadian AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canadian Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"canadianai2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aigicrv.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}