543 search results - page 2 / 109 » A Multiagent Algorithm for Graph Partitioning |
EUROPAR
1999
Springer
15 years 2 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
88
Voted
PC
2008
14 years 10 months ago
2008
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
CVPR
2012
IEEE
13 years 20 days ago
2012
IEEE
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
81
Voted
AAAI
2007
15 years 17 days ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
69
Voted
SIAMDM
2000
14 years 10 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...