Please use this identifier to cite or link to this item:
Title: Detecting hubs and quasi cliques in scale-free networks
Authors: Srihari, S.
Ng, H.K.
Ning, K.
Leong, H.W. 
Issue Date: 2008
Citation: Srihari, S.,Ng, H.K.,Ning, K.,Leong, H.W. (2008). Detecting hubs and quasi cliques in scale-free networks. Proceedings - International Conference on Pattern Recognition. ScholarBank@NUS Repository.
Abstract: Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In this paper, we model hubs as highdegree nodes and communities as quasi cliques. We propose a new problem formulation called the λ-LIST DOMINATING SET and show how this single problem is suited to model both the structures in real-world networks better than traditional problems like VERTEX COVER and CLIQUE. Additionally, we provide a fixed-parameter tractable algorithm to this detect these structures and show experimental results on Protein-Protein Interaction networks. © 2008 IEEE.
Source Title: Proceedings - International Conference on Pattern Recognition
ISBN: 9781424421756
ISSN: 10514651
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Oct 6, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.