Clique Relaxation Models in Social Network Analysis
From MaRDI portal
Publication:2917214
DOI10.1007/978-1-4614-0857-4_5zbMath1247.91162OpenAlexW1739450634MaRDI QIDQ2917214
Jeffrey Pattillo, Nataly Youssef, Sergiy I. Butenko
Publication date: 28 September 2012
Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0857-4_5
Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)
Related Items (15)
A review on algorithms for maximum clique problems ⋮ Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts ⋮ Frequency-driven tabu search for the maximum \(s\)-plex problem ⋮ Social structure optimization in team formation ⋮ An exact algorithm for the maximum probabilistic clique problem ⋮ On the 2-Club Polytope of Graphs ⋮ On solving simplified diversified top-\(k\,s\)-plex problem ⋮ Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications ⋮ Maximal strongly connected cliques in directed graphs: algorithms and bounds ⋮ An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem ⋮ Computing maximum \(k\)-defective cliques in massive graphs ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ Unnamed Item ⋮ Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints
Uses Software
This page was built for publication: Clique Relaxation Models in Social Network Analysis
