Sciweavers

961 search results - page 56 / 193
» Significance-Driven Graph Clustering
Sort
View
FCS
2006
15 years 5 months ago
Sub-Graphs of Complete Graph
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
Bichitra Kalita
ICPR
2008
IEEE
16 years 5 months ago
Coring method for clustering a graph
Thang V. Le, Casimir A. Kulikowski, Ilya B. Muchni...
ISAAC
2009
Springer
84views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Editing Graphs into Disjoint Unions of Dense Clusters
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Jo...