scientific article; zbMATH DE number 2086259
From MaRDI portal
Publication:3044359
Recommendations
- scientific article; zbMATH DE number 1424314
- A branch-and-bound approach for maximum quasi-cliques
- Fast algorithms for the maximum clique problem on massive sparse graphs
- Enumerating maximal cliques in large sparse graphs
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
Cited in
(46)- Multivariate algorithmics for finding cohesive subnetworks
- An exact algorithm for the maximum quasi‐clique problem
- The \textsc{max quasi-independent set} problem
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks
- On the maximum small-world subgraph problem
- On the planarization of wireless sensor networks
- On detecting maximal quasi antagonistic communities in signed graphs
- Micro-review synthesis for multi-entity summarization
- Editing graphs into disjoint unions of dense clusters
- A branch-and-bound approach for maximum quasi-cliques
- Finding maximum subgraphs with relatively large vertex connectivity
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- Dense subgraphs in random graphs
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- Computing maximum \(k\)-defective cliques in massive graphs
- MIP formulations for induced graph optimization problems: a tutorial
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- Online summarization of dynamic graphs using subjective interestingness for sequential data
- Subjective interestingness of subgraph patterns
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Asymptotic bounds for clustering problems in random graphs
- SQBC: an efficient subgraph matching method over large and dense graphs
- On maximum ratio clique relaxations
- LP-based dual bounds for the maximum quasi-clique problem
- Finding influential communities in networks with multiple influence types
- Subgraph detection
- In search of dense subgraphs: How good is greedy peeling?
- Robustness and strong attack tolerance of low-diameter networks
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Finding weighted k-truss communities in large networks
- An effective branch-and-bound algorithm for the maximum s-bundle problem
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques
- On Fast Enumeration of Pseudo Bicliques
- On finding the community with maximum persistence probability
- A survey on optimization studies of group centrality metrics
- Distributed discovery of large near-cliques
- A review on algorithms for maximum clique problems
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
- Finding quasi core with simulated stacked neural networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044359)
