Distance-based clique relaxations in networks: s-clique and s-club
From MaRDI portal
Publication:2820114
Recommendations
Cites work
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- Airline network design and hub location problems
- Algorithms for the maximum k-club problem in graphs
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- An exact algorithm for the maximum clique problem
- And What Is Your Erdos Number?
- Approximating maximum diameter-bounded subgraphs
- Clique relaxation models in social network analysis
- Clique-detection models in computational biochemistry and genomics
- Competition in a deregulated air transportation market
- Graph domination, coloring and cliques in telecommunications
- 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
- Linear degree extractors and the inapproximability of max clique and chromatic number
- New methods to color the vertices of a graph
- Novel approaches for analyzing biological networks
- On approximating the maximum diameter ratio of graphs
- On connected dominating sets of restricted diameter
- 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
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Reducibility among combinatorial problems
- Solving the maximum clique problem using a tabu search approach
- Strong computational lower bounds via parameterized complexity
- The Structure and Function of Complex Networks
- The maximum degree \& diameter-bounded subgraph and its applications
- Unit disk graphs
- Upper bounds and heuristics for the 2-club problem
- Variable neighborhood search
Cited in
(16)- Multivariate algorithmics for finding cohesive subnetworks
- Parsimonious formulations for low-diameter clusters
- On biconnected and fragile subgraphs of low diameter
- Projection-based link prediction in a bipartite network
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
- Density-based modularity for evaluating community structure in bipartite networks
- Graph signatures: identification and optimization
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- On the 2-club polytope of graphs
- Finding disjoint dense clubs in a social network
- Finding Disjoint Dense Clubs in an Undirected Graph
- On clique relaxation models in network analysis
- Asymptotic bounds for clustering problems in random graphs
- Finding conserved low-diameter subgraphs in social and biological networks
- Clique relaxation models in social network analysis
This page was built for publication: Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820114)
