1951 search results - page 23 / 391 » An algorithm for improving graph partitions |
JSS
2007
14 years 9 months ago
2007
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
ESA
2003
Springer
15 years 3 months ago
2003
Springer
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
CSCLP
2005
Springer
15 years 3 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
UAI
2004
14 years 11 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...