Computing maximum \(k\)-defective cliques in massive graphs
type: Item
instance of: scholarly article
title: Computing maximum \(k\)-defective cliques in massive graphs
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350527
zbMATH Keywords: relaxed clique
zbMATH Keywords: exact search
zbMATH Keywords: branch-and-bound
zbMATH Keywords: massive graphs
zbMATH Keywords: graph reduction
describes a project that uses: DIMACS
describes a project that uses: SNAP
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105131
OpenAlex ID: W3096767737
cites work: Q3044359
cites work: Graph Partitioning and Graph Clustering
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
cites work: Exact exponential algorithms.
cites work: Maximum weight relaxed cliques and Russian doll search revisited
cites work: A branch and bound algorithm for the maximum clique problem
cites work: Clique Relaxation Models in Social Network Analysis
cites work: On clique relaxation models in network analysis
cites work: A branch and cut solver for the maximum stable set problem
cites work: An exact bit-parallel algorithm for the maximum clique problem
cites work: A polyhedral study of the generalized vertex packing problem
cites work: An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations
cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
cites work: A review on algorithms for maximum clique problems
cites work: Node-and edge-deletion NP-complete problems
cites work: Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
DOI: 10.1016/J.COR.2020.105131
Recommended article: Q4945528
Recommended article: Q4688314
Recommended article: A new exact maximum clique algorithm for large and massive sparse graphs
Recommended article: Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Recommended article: Fast maximal cliques enumeration in sparse graphs
Recommended article: Exact algorithms for maximum clique: a computational study
Recommended article: Finding maximum cliques in arbitrary and in special graphs
Recommended article: Finding a Maximum Clique in an Arbitrary Graph
Recommended article: Theoretical underpinnings for maximal clique enumeration on perturbed graphs
description: scientific article; zbMATH DE number 7350527