24 search results - page 2 / 5 » Hypergraph Partitioning with Fixed Vertices |
COMBINATORICS
2004
13 years 5 months ago
2004
Let (0, 1), l 2 and let Hn be an l-graph on n vertices. Hn is (, )-uniform if every n vertices of Hn span (
CLIMA
2010
13 years 6 months ago
2010
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
ICTAI
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...