On finding the community with maximum persistence probability
From MaRDI portal
Cites work
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A branch-and-bound approach for maximum quasi-cliques
- A branch-and-price procedure for clustering data that are graph connected
- A graph‐theoretic generalization of the clique concept
- A note on two problems in connexion with graphs
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- Clique relaxations in social network analysis: the maximum k-plex problem
- Clustering data that are graph connected
- Community structure in social and biological networks
- Fast unfolding of communities in large networks
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- scientific article; zbMATH DE number 6180551 (Why is no real title available?)
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
- On clique relaxation models in network analysis
- On the maximum quasi-clique problem
- On the maximum small-world subgraph problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Programming with linear fractional functionals
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
This page was built for publication: On finding the community with maximum persistence probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655141)
