188 search results - page 2 / 38 » A new meta-method for graph partitioning |
CORR
2012
Springer
12 years 12 days ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
ISCAS
1994
IEEE
13 years 8 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
FOCI
2007
IEEE
13 years 11 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
ICPP
1995
IEEE
13 years 8 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...