2314 search results - page 83 / 463 » Minimal Partitions of a Graph |
121
Voted
AAAI
2008
15 years 5 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...
137
Voted
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
118
Voted
ICIP
2008
IEEE
15 years 10 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...
112
Voted
CSCLP
2005
Springer
15 years 9 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...
154
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...