Effective K-Vertex connected component detection in large-scale networks
Finding components with high connectivity is an important problem in component detection with a wide range of applications, e.g., social network analysis, web-page research and bioinformatics. In particular, k-edge connected component (k-ECC) has recently been extensively studied to discover disjoin...
Saved in:
Main Authors: | LI, Yuan, ZHAO, Yuha, WANG, Guoren, ZHU, Feida, WU, Yubao, SHI, Shenglei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3617 https://ink.library.smu.edu.sg/context/sis_research/article/4618/viewcontent/EffectiveK_VertexConnectedComp_2017_afv.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Towards k-vertex connected component discovery from large networks
by: YUAN, Li, et al.
Published: (2020) -
Sarships: A component-based system for ship detection on SAR images
by: Yuan, B., et al.
Published: (2014) -
Liver Segmentation on a Variety of Computed Tomography (CT) Images Based on Convolutional Neural Networks Combined with Connected Components
by: Hoang, Hong Son, et al.
Published: (2020) -
C³: Code clone-based identification of duplicated components
by: YANG, Yanming, et al.
Published: (2023) -
C[subscript 2]-cofiniteness of the vertex algebra V[subscript L] [superscript +] and classification of irreducible modules of the vertex operator algebra V[subscript L] [superscript +<r>]
by: Phichet Jitjankarn
Published: (2011)