1221 search results - page 44 / 245 » Balanced graph partitioning |
123
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
172
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
135
click to vote
PR
2000
2000
A region-level motion-based graph representation and labeling for tracking a spatial image partition
15 years 3 months ago
This paper addresses two image sequence analysis issues under a common framework. These tasks are, "rst, motion-based segmentation and second, updating and tracking over time...
177
click to vote
JMLR
2012
13 years 6 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
130
click to vote
ORL
2007
15 years 3 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...