Finding large k-clubs in undirected graphs
From MaRDI portal
Recommendations
- Algorithms for the maximum k-club problem in graphs
- Heuristics for finding \(k\)-clubs in an undirected graph
- On inclusionwise maximal and maximum cardinality k-clubs in graphs
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Cites work
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3800811 (Why is no real title available?)
- A graph‐theoretic definition of a sociometric clique†
- A measure \& conquer approach for the analysis of exact algorithms
- A new approach to dynamic all pairs shortest paths
- Algorithms for the maximum k-club problem in graphs
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Approximating maximum diameter-bounded subgraphs
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Graph Clustering and Minimum Cut Trees
- Heuristics for finding \(k\)-clubs in an undirected graph
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
- Integer models and upper bounds for the 3-club problem
- Novel approaches for analyzing biological networks
- On clusterings: good, bad and spectral
- On inclusionwise maximal and maximum cardinality k-clubs in graphs
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Parameterized computational complexity of finding small-diameter subgraphs
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Solving the maximum clique problem using a tabu search approach
- Upper bounds and heuristics for the 2-club problem
Cited in
(27)- Multivariate algorithmics for finding cohesive subnetworks
- Finding clubs in graph classes
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- On the tractability of finding disjoint clubs in a network
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Covering a graph with clubs
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- On the 2-club polytope of graphs
- On the hardness of problems around s-clubs on split graphs
- Computing dense and sparse subgraphs of weakly closed graphs
- Finding disjoint dense clubs in a social network
- Finding Disjoint Dense Clubs in an Undirected Graph
- Algorithms for the maximum k-club problem in graphs
- On inclusionwise maximal and maximum cardinality k-clubs in graphs
- The parameterized complexity of \(s\)-club with triangle and seed constraints
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- A hybrid artificial immune network for detecting communities in complex networks
- The parameterized complexity of \(s\)-club with triangle and seed constraints
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Cliques and clubs
- On the tractability of covering a graph with 2-clubs
- Heuristics for finding \(k\)-clubs in an undirected graph
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
This page was built for publication: Finding large \(k\)-clubs in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488393)
