The triangle \(k\)-club problem
From MaRDI portal
Publication:2359790
DOI10.1007/s10878-016-0009-9zbMath1372.90089OpenAlexW2425914729MaRDI QIDQ2359790
Filipa D. Carvalho, Maria Teresa Almeida
Publication date: 22 June 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0009-9
Social networks; opinion dynamics (91D30) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
The parameterized complexity of \(s\)-club with triangle and seed constraints, Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments, On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs, The parameterized complexity of \(s\)-club with triangle and seed constraints, The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms, On the maximum small-world subgraph problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Upper bounds and heuristics for the 2-club problem
- Selected combinatorial problems of computational biology
- Projection, lifting and extended formulation integer and combinatorial optimization
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- On the maximum quasi-clique problem
- Heuristics for finding \(k\)-clubs in an undirected graph
- On clique relaxation models in network analysis
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Mining market data: a network approach
- Novel approaches for analyzing biological networks
- A review on algorithms for maximum clique problems
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- OR FORUM—Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher
- A graph‐theoretic definition of a sociometric clique†
- The Structure and Function of Complex Networks
- Integer models and upper bounds for the 3‐club problem
- Collective dynamics of ‘small-world’ networks
