CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On Maximum Degree-Based Γ-Quasi-Clique Problem: Complexity And Exact Approaches
Authors
Vladimir Boginski
Grigory Pastukhov
Oleg A. Prokopyev
Alexander Veremyev
Publication date
1 March 2018
Publisher
'Information Bulletin on Variable Stars (IBVS)'
Abstract
We consider the problem of finding a degree-based γ-quasi-clique of maximum cardinality in a given graph for some fixed γ ∈ (0,1]. A degree-based γ-quasi-clique (often referred to as simply a quasi-clique) is a subgraph, where the degree of each vertex is at least γ times the maximum possible degree of a vertex in the subgraph. A degree-based γ-quasi-clique is a relative clique relaxation model, where the case of γ=1 corresponds to the well-known concept of a clique. In this article, we first prove that the problem is NP-hard for any fixed γ ∈ (0,1], which addresses one of the open questions in the literature. More importantly, we also develop new exact solution methods for solving the problem and demonstrate their advantages and limitations in extensive computational experiments with both random and real-world networks. Finally, we outline promising directions of future research including possible functional generalizations of the considered clique relaxation model. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(2), 136–152 2018
Similar works
Full text
Available Versions
University of Central Florida (UCF): STARS (Showcase of Text, Archives, Research & Scholarship)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:stars.library.ucf.edu:scop...
Last time updated on 18/10/2022