241 search results - page 18 / 49 » Graphs, Hypergraphs and Hashing |
88
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
101
Voted
VLSISP
2008
15 years 1 months ago
2008
Abstract. In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound ...
158
click to vote
PKDD
2004
Springer
15 years 7 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
128
click to vote
CPC
2007
15 years 1 months ago
2007
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...
320
click to vote
IWOCA
2010
Springer
14 years 8 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...