Detecting dense subgraphs in complex networks based on edge density coefficient

被引：0
|
作者：
机构：
[1] [1,Guan, Bo
[2] Zan, Xiangzhen
[3] Xiao, Biyu
[4] Ma, Runnian
[5] Zhang, Fengyue
[6] Liu, Wenbin
来源：
Guan, B. (guanbo@nbut.cn) | 1600年 / Chinese Institute of Electronics卷 / 22期
基金：
中国国家自然科学基金;
关键词：
Bioinformatics - Gene Ontology - Yeast;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Mining Frequent Dense Subgraphs based on Extending Vertices from Unbalanced PPI Networks
    Wang, Miao
    Shang, Xuequn
    Xie, Di
    Li, Zhanhuai
    2009 3RD INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING, VOLS 1-11, 2009, : 845 - 851
  • [22] Detecting communities in complex networks using triangles and modularity density
    Zhang, Teng
    Lu, Pengli
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2023, 613
  • [23] Compressed Representation of Web and Social Networks via Dense Subgraphs
    Hernandez, Cecilia
    Navarro, Gonzalo
    STRING PROCESSING AND INFORMATION RETRIEVAL: 19TH INTERNATIONAL SYMPOSIUM, SPIRE 2012, 2012, 7608 : 264 - 276
  • [24] Dense Temporal Subgraphs in Protein-Protein Interaction Networks
    Dondi, Riccardo
    Hosseinzadeh, Mohammad Mehdi
    Zoppis, Italo
    COMPUTATIONAL SCIENCE, ICCS 2022, PT II, 2022, : 469 - 480
  • [25] Discovering Dense Subgraphs in Parallel for Compressing Web and Social Networks
    Hernandez, Cecilia
    Marin, Mauricio
    STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2013), 2013, 8214 : 165 - 173
  • [26] K-scaffold subgraphs of complex networks
    Corominas-Murtra, B.
    Valverde, S.
    Rodriguez-Caso, C.
    Sole, R. V.
    EPL, 2007, 77 (01)
  • [27] Optimal local community detection in social networks based on density drop of subgraphs
    Qi, Xingqin
    Tang, Wenliang
    Wu, Yezhou
    Guo, Guodong
    Fuller, Eddie
    Zhang, Cun-Quan
    PATTERN RECOGNITION LETTERS, 2014, 36 : 46 - 53
  • [28] Identification of functional information subgraphs in complex networks
    Bettencourt, Luis M. A.
    Gintautas, Vadas
    Ham, Michael I.
    PHYSICAL REVIEW LETTERS, 2008, 100 (23)
  • [29] Eb&D: A new clustering approach for signed social networks based on both edge-betweenness centrality and density of subgraphs
    Qi, Xingqin
    Song, Huimin
    Wu, Jianliang
    Fuller, Edgar
    Luo, Rong
    Zhang, Cun-Quan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 482 : 147 - 157
  • [30] A Parallel Algorithm for Counting Subgraphs in Complex Networks
    Ribeiro, Pedro
    Silva, Fernando
    Lopes, Luis
    BIOMEDICAL ENGINEERING SYSTEMS AND TECHNOLOGIES, 2011, 127 : 380 - +
12345