Comparing recent methods in graph partitioning

Electronic Notes in Discrete Mathematics

Volumn 22, Issue , 2005, Pages 83-89

  Guenoche A ^a  

^a IML CNRS   (France)

Author keywords

Density function; Graph partitioning; Optimization; Simulation

Indexed keywords

EID: 34247110918     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.015     Document Type: Article

References (10)

1. Alpert C.J., and Kang A. Recent direction in netlist partitioning: a survey. Integration: the VLSI Journal 19 1-2 (1995) 1-81
2. Bader G.D., and Hogue C.W. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4 (2003) 2 27 p
3. Barabasi L. The large-scale organization of metabolic networks. Nature 407 (2000) 651-654
4. Batagelj V., and Mrvar M. Partitioning approach to visualisation of large graphs. Lecture Notes in Computer Science 1731 (1999), Springer 90-97
5. Colombo, T., A. Guénoche, Y. Quentin, Looking for high density areas in graph : Application to orthologous genes, (2003), submitted
6. Girvan M., and Newman M.E.J. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99 (2002) 7821-7826
7. Guénoche A. Partitions optimisées selon différents criteres; Evaluation et comparaison. Math. & Sci. hum. 161 (2003) 41-58
8. Moody J. Identifying dense clusters in large networks. Social Networks 23 (2001) 261-283
9. Newman M.E.J. Scientific Collaboration Networks : Shortest paths, weighted networks and centrality. Phys. Rev. 64 (2001)
10. Wishart D. Mode analysis : generalization of nearest neighbor which reduces chaining effects. Numerical taxonomy (1976), Academic Press 282-311