1951 search results - page 9 / 391 » An algorithm for improving graph partitions |
ICAPR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
— We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a Hierarchical Tree Partitioning algorithm derived from ...
SIAMDM
2000
13 years 8 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
WCET
2008
13 years 10 months ago
2008
GLVLSI
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we present a clustering based algorithm for acyclic multi-way partitioning. Many existing partitioning algorithms have shown that clustering can effectively improv...