823 search results - page 80 / 165 » Brick partitions of graphs |
145
click to vote
DM
2006
15 years 6 months ago
2006
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...
162
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
150
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
126
click to vote
IROS
2006
IEEE
16 years 6 days 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 ...
153
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...