Document
Services
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook
|
||||||||||||||||||
RAIRO-Oper. Res. 42 (2008) 469-484
DOI: 10.1051/ro:2008029
Comparison of algorithms in graph partitioning
Alain GuénocheIML-CNRS, 163 Av. de Luminy, 13288 Marseille Cedex 9, France; guenoche@lim.univ-mrs.fr
Received December 31, 2006. Accepted January 09, 2008 Published online 4 April 2009
Abstract
We first describe four recent methods to cluster vertices of an
undirected non weighted connected graph. They are all based on
very different principles. The fifth is a combination of classical
ideas in optimization applied to graph partitioning. We compare
these methods according to their ability to recover classes
initially introduced in random graphs with more edges within the
classes than between them.
Mathematics Subject Classification. 05C85, 90C35, 90C59.
Key words: Graph partitioning, partition comparison, simulation.
© EDP Sciences, ROADEF, SMAI 2008
| What is OpenURL? |
The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.