420 search results - page 38 / 84 » Search on High Degree Graphs |
209
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
83
Voted
IV
2005
IEEE
15 years 6 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
84
Voted
ENTER
2009
Springer
15 years 5 months ago
2009
Springer
Hyperlinks are the essence of the World Wide Web. Their importance is very high due to their ability to provide a visitor with a wealth of good quality information and for the rol...
122
Voted
BIOCOMP
2008
15 years 2 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
109
Voted
PC
2000
15 years 15 days ago
2000
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...