9532 search results - page 302 / 1907 » Logic, Graphs, and Algorithms |
178
Voted
SPAA
2005
ACM
16 years 6 days ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
160
click to vote
PAKDD
2010
ACM
15 years 11 months ago
2010
ACM
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
123
click to vote
JGT
2006
15 years 6 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
187
click to vote
PAMI
2008
15 years 6 months ago
2008
This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geo...
215
click to vote
IPL
2002
15 years 6 months ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...