On clustering coefficients of graphs with the fixed numbers of vertices and edges.
Norikazu TakahashiPublished in: ECCTD (2009)
Keyphrases
- weighted graph
- undirected graph
- graph clustering
- graph theoretic
- edge weights
- graph partitioning
- directed graph
- directed edges
- densely connected
- clustering algorithm
- vertex set
- linear combination
- random graphs
- hierarchical clustering
- clustering method
- unsupervised learning
- real world graphs
- data clustering
- maximum cardinality
- attributed graphs
- labeled graphs
- spanning tree
- adjacency matrix
- graph matching
- graph structure
- data objects
- spectral embedding
- k means
- query graph
- nodes of a graph
- hamiltonian cycle
- planar graphs
- pairwise similarities
- subgraph isomorphism
- graph model
- spectral clustering
- document clustering
- basis functions
- shortest path
- normalized cut
- edge information
- graph mining
- complex networks
- self organizing maps
- pairwise