301 search results - page 39 / 61 » On Finding Dense Subgraphs |
PODS
1998
ACM
15 years 1 months ago
1998
ACM
The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknessesof the large itemset...
VISSYM
2007
15 years 2 days ago
2007
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
125
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
WAIM
2007
Springer
15 years 3 months ago
2007
Springer
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
175
click to vote
ASUNAM
2011
IEEE
13 years 9 months ago
2011
IEEE
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...