151 search results - page 24 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
106
click to vote
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
IJCAI
2007
15 years 1 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
143
click to vote
PODC
2010
ACM
15 years 4 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
103
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...