Sciweavers

420 search results - page 9 / 84
» Search on High Degree Graphs
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 8 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
JAIR
1998
92views more  JAIR 1998»
13 years 7 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
HPCC
2005
Springer
14 years 28 days ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
CIKM
2009
Springer
14 years 2 months ago
Privacy-enhanced public view for social graphs
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
Hyoungshick Kim, Joseph Bonneau