301 search results - page 57 / 61 » On Finding Dense Subgraphs |
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
150
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
Online social networks are now a popular way for users to connect, express themselves, and share content. Users in today's online social networks often post a profile, consis...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...