1951 search results - page 104 / 391 » An algorithm for improving graph partitions |
131
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
134
Voted
PAMI
2010
15 years 2 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
125
click to vote
JGAA
2007
15 years 4 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
140
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
122
click to vote
IPL
2002
15 years 4 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...