On the 2-Club Polytope of Graphs
From MaRDI portal
Publication:2957469
DOI10.1287/opre.2016.1500zbMath1354.05035OpenAlexW2442815085MaRDI QIDQ2957469
Balabhaskar Balasundaram, Foad Mahdavi Pajouh, Illya V. Hicks
Publication date: 26 January 2017
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2016.1500
Social networks; opinion dynamics (91D30) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts ⋮ Influence Maximization with Latency Requirements on Social Networks ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ On biconnected and fragile subgraphs of low diameter ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Parsimonious formulations for low-diameter clusters ⋮ An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
Uses Software
Cites Work
- Unnamed Item
- Algorithms for the maximum \(k\)-club problem in graphs
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Finding large \(k\)-clubs in undirected graphs
- Upper bounds and heuristics for the 2-club problem
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- A class of facet producing graphs for vertex packing polyhedra
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Parameterized computational complexity of finding small-diameter subgraphs
- 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
- Network-based marketing: identifying likely adopters via consumer networks
- Novel approaches for analyzing biological networks
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
- Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
- On Editing Graphs into 2-Club Clusters
- Clique Relaxation Models in Social Network Analysis
- Approximating Maximum Diameter-Bounded Subgraphs
- A graph‐theoretic definition of a sociometric clique†
- Vertex packings: Structural properties and algorithms
- Community structure in social and biological networks
- Polyhedral techniques in combinatorial optimization I: Theory
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Integer models and upper bounds for the 3‐club problem
- Canonical Cuts on the Unit Hypercube
This page was built for publication: On the 2-Club Polytope of Graphs
