Sciweavers

301 search results - page 9 / 61
» On Finding Dense Subgraphs
Sort
View
SOCIALCOM
2010
14 years 7 months ago
Decomposing Social Networks
: Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various sub...
Whitman Richards, Owen Macindoe
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
14 years 11 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
BMCBI
2006
141views more  BMCBI 2006»
14 years 9 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
AAAI
2006
14 years 11 months ago
Identification and Evaluation of Weak Community Structures in Networks
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
Jianhua Ruan, Weixiong Zhang
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
14 years 11 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...