On the maximum locally clustered subgraph and some related problems

Authors:
Bang Ye Wu
Affiliations:
National Chung Cheng University, ChiaYi, Taiwan, R.O.C.
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 10
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Latent Friend Mining from Blog Data

ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Analysis of topological characteristics of huge online social networking services

Proceedings of the 16th international conference on World Wide Web
Measurement and analysis of online social networks

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Finding Friend Groups in Blogosphere

AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
Growth of the flickr social network

Proceedings of the first workshop on Online social networks
Why We Twitter: An Analysis of a Microblogging Community

Advances in Web Mining and Web Usage Analysis
Influence clubs in social networks

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by detecting false friend links in online social networks, we define two optimization problems based on the balance theory for structural transitivity in social networks. We give a polynomial time algorithm for one problem and show the NP-hardness of the other. For the NP-hard problem, we show some polynomial time solvable cases and give a 2-approximation algorithm for a restricted version. We also propose a heuristic algorithm for a more general version of the problem.