280 search results - page 31 / 56 » New Algorithms for Enumerating All Maximal Cliques |
101
click to vote
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
SPAA
1993
ACM
15 years 3 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
103
click to vote
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency ove...
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents a Domain Modeling System, which builds a domain model framework for adaptive Web systems. It records concepts and the relationships among them and represents t...
165
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...