{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T13:39:16Z","timestamp":1791034756248,"version":"4.1.0"},"reference-count":26,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1051\/ro:2008029","type":"journal-article","created":{"date-parts":[[2008,10,13]],"date-time":"2008-10-13T11:10:20Z","timestamp":1223896220000},"page":"469-484","source":"Crossref","is-referenced-by-count":6,"title":["Comparison of algorithms in graph partitioning"],"prefix":"10.1051","volume":"42","author":[{"given":"Alain","family":"Gu\u00e9noche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2009,4,4]]},"reference":[{"key":"R1","unstructured":"C.J. Alpert and A. Kang, Recent direction in netlist partitioning: a survey,Integration. VLSI J.19 (1-2)(1995) 1\u201381."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"G.D. Bader and C.W. Hogue, An automated method for finding molecular complexes in large protein interaction networks.BMC Bioinformatics4 (2)(2003) 27.","DOI":"10.1186\/1471-2105-4-2"},{"key":"R3","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1038\/35036627","volume":"407","author":"Barabasi","year":"2000","journal-title":"Nature"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"V. Batagelj and M. Mrvar, Partitioning approach to visualisation of large graphs,Lect. Notes Comput. Sci.1731, Springer (1999) 90\u201397.","DOI":"10.1007\/3-540-46648-7_9"},{"key":"R5","unstructured":"V. Batagelj and M. Zaver\u0161nik, An $O(m)$ algorithm for cores decomposition of networks (2001)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1186\/1471-2105-7-488","volume":"7","author":"Broh\u00e9e","year":"2006","journal-title":"BMC Bioinformatics"},{"key":"R7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1186\/1471-2105-5-95","volume":"5","author":"Brun","year":"2004","journal-title":"BMC Bioinformatics"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"I. Charon, L. Denoeud, A. Gu\u00e9noche, and O. Hudry, Comparing partitions by element transfert.J. Classif.23 (1)(2006) 103\u2013121.","DOI":"10.1007\/s00357-006-0006-2"},{"key":"R9","unstructured":"T. Colombo, A. Gu\u00e9noche, and Y. Quentin, Looking for high density areas in graph: Application to orthologous genes, Actes des Journ\u00e9es Informatiques de Metz, 2003, pp. 203\u2013212."},{"key":"R10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0165-4896(81)90042-1","volume":"1","author":"The","year":"1981","journal-title":"Math. Soc. Sci."},{"key":"R11","unstructured":"S. Van Dongen,Graph Clustering by Flow Simulation.Ph.D. Thesis, University of Utrecht (2000)."},{"key":"R12","unstructured":"J. Duch and A. Arenas, Community detection in complex networks using Extremal Optimization, arXiv:cond-mat\/0501368 (2005) 4 p."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1093\/nar\/30.7.1575","volume":"30","author":"Enright","year":"2002","journal-title":"Nucleic Acids Res."},{"key":"R14","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"R15","unstructured":"A. Gu\u00e9noche, Partitions optimis\u00e9es selon diff\u00e9rents crit\u00e8res; Evaluation et comparaison.Math. Sci. Hum.161(2003) 41\u201358."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"A. Gu\u00e9noche, Clustering by vertex density in a graph, inProceedings of IFCS congress.Classification, Clustering and Data Mining Applications, edited by D. Banks et al., Springer (2004) 15\u201324.","DOI":"10.1007\/978-3-642-17103-1_2"},{"key":"R17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF02294245","volume":"50","author":"Milligan","year":"1985","journal-title":"Psychometrica"},{"key":"R18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0378-8733(01)00042-9","volume":"23","author":"Moody","year":"2001","journal-title":"Social Networks"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"M.E.J. Newman, Scientific Collaboration Networks: Shortest paths, weighted networks and centrality.Phys. Rev.(2001) 64.","DOI":"10.1103\/PhysRevE.64.016132"},{"key":"R20","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"R21","unstructured":"M.E.J. Newman, Modularity and community structure in networks. arXiv:physics\/0602124v1, (2006) 7 p."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"P. Pons and M. Latapy, Computing communities in large networks using random walks.J. Graph Algorithms Appl.10 (2), (2006) 191\u2013218.","DOI":"10.7155\/jgaa.00124"},{"key":"R23","unstructured":"S. R\u00e9gnier, Sur quelques aspects math\u00e9matiques des probl\u00e8mes de classification automatique.ICC Bulletin(1964)."},{"key":"R24","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1186\/1471-2105-4-15","volume":"4","author":"Rougemont","year":"2003","journal-title":"BMC Bioinformatics"},{"key":"R25","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"Seidman","year":"1983","journal-title":"Social Networks"},{"key":"R26","unstructured":"D. Wishart, Mode analysis: generalization of nearest neighbor which reduces chaining effects, inNumerical taxonomy, Academic Press (1976) 282\u2013311."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008029\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T12:22:19Z","timestamp":1557836539000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":26,"journal-issue":{"issue":"4"},"alternative-id":["ro0806"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008029","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}