1127 search results - page 44 / 226 » Testing the Expansion of a Graph |
SIGMOD
2007
ACM
14 years 11 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
SIGIR
2009
ACM
14 years 5 months ago
2009
ACM
Link analysis methods have been used successfully for knowledge discovery from the link structure of mutually linking entities. Existing link analysis methods have been inherently...
STOC
1992
ACM
14 years 3 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
SIGIR
2010
ACM
14 years 2 months ago
2010
ACM
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
PDP
2005
IEEE
14 years 4 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...