1951 search results - page 240 / 391 » An algorithm for improving graph partitions |
145
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
131
Voted
ICALP
1995
Springer
15 years 8 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
171
click to vote
JBI
2004
15 years 6 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
154
click to vote
COCOA
2009
Springer
15 years 9 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
116
click to vote
GD
2009
Springer
15 years 9 months ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...