Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
From MaRDI portal
Publication:3013924
DOI10.1287/opre.1100.0851zbMath1218.90228MaRDI QIDQ3013924
Illya V. Hicks, Balabhaskar Balasundaram, Sergiy I. Butenko
Publication date: 19 July 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1100.0851
maximum clique problem; scale-free graphs; social network analysis; clique relaxations; power law graphs; cohesive subgroups; maximum \(k\)-plex problem
Related Items
Finding groups with maximum betweenness centrality, Approximating Bounded Degree Deletion via Matroid Matching, Integer models and upper bounds for the 3‐club problem, Robustness and Strong Attack Tolerance of Low-Diameter Networks, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, The minimal \(k\)-core problem for modeling \(k\)-assemblies, Finding maximum subgraphs with relatively large vertex connectivity, Two-phase heuristics for the \(k\)-club problem, On a generalization of Nemhauser and Trotter's local optimization theorem, Social structure optimization in team formation, Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations, Co-2-plex polynomials, Combinatorial algorithms for the maximum \(k\)-plex problem, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, On making a distinguished vertex of minimum degree by vertex deletion, Upper bounds and heuristics for the 2-club problem, A generalization of Nemhauser and Trotter's local optimization theorem, Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number, A network-based data mining approach to portfolio selection via weighted clique relaxations, A branch-and-bound approach for maximum quasi-cliques, On bounded-degree vertex deletion parameterized by treewidth, Isolation concepts for efficiently enumerating dense subgraphs, Enhancing quantum annealing performance for the molecular similarity problem, Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes, Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes, An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems, The triangle \(k\)-club problem, Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion, Discovery of extreme events-related communities in contrasting groups of physical system networks, A review on algorithms for maximum clique problems, Approximating 2-cliques in unit disk graphs, Extended and discretized formulations for the maximum clique problem, Discrete Optimization with Decision Diagrams, A Parameterized Algorithm for Bounded-Degree Vertex Deletion, On Making a Distinguished Vertex Minimum Degree by Vertex Deletion, A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
Uses Software
