136 search results - page 9 / 28 » Graph Nodes Clustering Based on the Commute-Time Kernel |
APVIS
2007
15 years 1 months ago
2007
In this paper, we introduce a new method, GraphScape, to visualize multivariate networks, i.e., graphs with multivariate data associated with their nodes. GraphScape adopts a land...
CORR
2007
Springer
14 years 11 months 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...
APVIS
2009
15 years 23 days ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
110
click to vote
IV
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...