Paper Info
Title
A multiagent algorithm for graph partitioning
Abstract
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we present a new simple multiagent algorithm, ants, and we test its performance with standard graph benchmarks. The results show that this method can outperform several current methods while it is very simple to implement.
Year
DOI
Venue
2006
10.1007/11732242_25
EvoWorkshops
Keywords
Field
DocType
different algorithm,cut edge,k-cut problem,standard graph benchmarks,evolutionary method,graph partitioning,np-complete problem,k balanced part,new simple multiagent algorithm,current method,np complete problem
Cut,Strength of a graph,Computer science,Algorithm,Mixed graph,Graph bandwidth,Graph partition,Graph (abstract data type),Maximum cut,Moral graph
Conference
Volume
ISSN
ISBN
3907
0302-9743
3-540-33237-5
Citations 
PageRank 
References 
4
0.49
9
Authors
2
Name
Order
Citations
PageRank
Francesc Comellas115525.07
Emili Sapena2916.50