2004 search results - page 103 / 401 » Sampling from large graphs |
112
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
122
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
136
click to vote
PVLDB
2010
15 years 1 months ago
2010
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
116
click to vote
ICDCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Live peer-to-peer (P2P) streaming applications have been successfully deployed in the Internet. With relatively simple peer selection protocol design, modern live P2P streaming ap...
207
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Although the presence of a schema enables many optimizations for operations on XML documents, recent studies have shown that many XML documents in practice either do not refer to ...