Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
From MaRDI portal
Publication:2820114
DOI10.1007/978-1-4614-8588-9_10zbMath1344.90064OpenAlexW2203716775MaRDI QIDQ2820114
Shahram Shahinpour, Sergiy I. Butenko
Publication date: 13 September 2016
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8588-9_10
Related Items (12)
Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts ⋮ Finding disjoint dense clubs in a social network ⋮ On the 2-Club Polytope of Graphs ⋮ On biconnected and fragile subgraphs of low diameter ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Parsimonious formulations for low-diameter clusters ⋮ Finding Disjoint Dense Clubs in an Undirected Graph ⋮ Graph signatures: identification and optimization ⋮ Density-based modularity for evaluating community structure in bipartite networks ⋮ Projection-based link prediction in a bipartite network ⋮ Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters ⋮ Exact algorithms for the minimum \(s\)-club partitioning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Upper bounds and heuristics for the 2-club problem
- Strong computational lower bounds via parameterized complexity
- An exact algorithm for the maximum clique problem
- Unit disk graphs
- On approximating the maximum diameter ratio of graphs
- Variable neighborhood search
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- A fast algorithm for the maximum clique problem
- Parameterized computational complexity of finding small-diameter subgraphs
- Competition in a deregulated air transportation market
- Heuristics for finding \(k\)-clubs in an undirected graph
- On structural parameterizations for the 2-club problem
- On connected dominating sets of restricted diameter
- Solving the maximum clique problem using a tabu search approach
- The maximum degree \& diameter-bounded subgraph and its applications
- Clique-detection models in computational biochemistry and genomics
- Novel approaches for analyzing biological networks
- Clique Relaxation Models in Social Network Analysis
- Proof verification and the hardness of approximation problems
- Approximating Maximum Diameter-Bounded Subgraphs
- Probabilistic checking of proofs
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- New methods to color the vertices of a graph
- Airline network design and hub location problems
- The Structure and Function of Complex Networks
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Reducibility among Combinatorial Problems
- Integer models and upper bounds for the 3‐club problem
- And What Is Your Erdos Number?
This page was built for publication: Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
