Sciweavers

543 search results - page 2 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
EUROPAR
1999
Springer
13 years 10 months ago
A New Algorithm for Multi-objective Graph Partitioning
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...
Kirk Schloegel, George Karypis, Vipin Kumar
PC
2008
111views Management» more  PC 2008»
13 years 5 months ago
A partitioning algorithm for block-diagonal matrices with overlap
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...
Guy Antoine Atenekeng Kahou, Laura Grigori, Masha ...
CVPR
2012
IEEE
11 years 8 months ago
Segmentation using superpixels: A bipartite graph partitioning approach
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...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
AAAI
2007
13 years 8 months ago
Graph Partitioning Based on Link Distributions
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...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
SIAMDM
2000
77views more  SIAMDM 2000»
13 years 5 months ago
Recognizing Perfect 2-Split Graphs
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...
Chính T. Hoàng, Van Bang Le