961 search results - page 47 / 193 » Significance-Driven Graph Clustering |
92
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
95
Voted
SAC
2009
ACM
15 years 7 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
115
Voted
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
132
click to vote
KAIS
2011
14 years 7 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
90
Voted
COMBINATORICS
2004
15 years 14 days ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...