2314 search results - page 178 / 463 » Minimal Partitions of a Graph |
110
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
139
click to vote
EVOW
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified ...
155
click to vote
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
143
click to vote
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
162
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...