A dynamic programming algorithm for the maximum s-club problem on trees
From MaRDI portal
A dynamic programming algorithm for the maximum \(s\)-club problem on trees
Cites work
- A fast algorithm for the maximum clique problem
- A graph‐theoretic definition of a sociometric clique†
- A review on algorithms for maximum clique problems
- Algorithm 457: finding all cliques of an undirected graph
- Algorithm to find a maximum 2-packing set in a cactus
- Algorithms for the maximum k-club problem in graphs
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Approximating Maximum Clique by Removing Subgraphs
- Approximating maximum diameter-bounded subgraphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Clique relaxation models in social network analysis
- Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
- Covering a graph with clubs
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Finding conserved low-diameter subgraphs in social and biological networks
- From gap-ETH to FPT-inapproximability: clique, dominating set, and more
- Heuristics for finding \(k\)-clubs in an undirected graph
- scientific article; zbMATH DE number 3827200 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- 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 biconnected and fragile subgraphs of low diameter
- On inclusionwise maximal and maximum cardinality k-clubs in graphs
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- On structural parameterizations for the 2-club problem
- On the 2-club polytope of graphs
- On the parameterized complexity of non-hereditary relaxations of clique
- Parameterized algorithmics and computational experiments for finding 2-clubs
- Parameterized computational complexity of finding small-diameter subgraphs
- Parsimonious formulations for low-diameter clusters
- Upper bounds and heuristics for the 2-club problem
This page was built for publication: A dynamic programming algorithm for the maximum \(s\)-club problem on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854708)
