99 search results - page 8 / 20 » Multilevel Graph Partitioning Schemes |
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
SWAT
2010
Springer
14 years 17 days 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...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
CVIU
2008
13 years 7 months ago
2008
We propose a novel scheme for using supervised learning for function-based classification of objects in 3D images. During the learning process, a generic multi-level hierarchical ...
FSTTCS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...