241 search results - page 6 / 49 » Graphs, Hypergraphs and Hashing |
86
Voted
JGT
2006
14 years 11 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
EJC
2007
14 years 11 months ago
2007
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
76
Voted
ISCAS
1994
IEEE
15 years 3 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
CAIP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...