193 search results - page 16 / 39 » The structure of almost all graphs in a hereditary property |
TAMC
2010
Springer
14 years 20 days ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
WG
1993
Springer
13 years 11 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
KAIS
2011
13 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
SIGLEX
1991
13 years 11 months ago
1991
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
IJON
2010
13 years 4 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...