1221 search results - page 78 / 245 » Balanced graph partitioning |
AAAI
2008
13 years 11 months ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
ICIP
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
TVCG
2012
11 years 11 months ago
2012
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
CIAC
2010
Springer
14 years 6 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...