The following pages link to (Q3044359):
Displaying 42 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Subjective interestingness of subgraph patterns (Q338641) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- Finding quasi core with simulated stacked neural networks (Q526647) (← links)
- On the planarization of wireless sensor networks (Q548669) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Distributed discovery of large near-cliques (Q661050) (← links)
- A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- Finding weighted \(k\)-truss communities in large networks (Q778465) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
- A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- On detecting maximal quasi antagonistic communities in signed graphs (Q1741135) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- Dense subgraphs in random graphs (Q1741497) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Finding influential communities in networks with multiple influence types (Q2056381) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Online summarization of dynamic graphs using subjective interestingness for sequential data (Q2659275) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On Fast Enumeration of Pseudo Bicliques (Q3000513) (← links)
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques (Q3294898) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Techniques for analyzing dynamic random graph models of web-like networks: An overview (Q3515881) (← links)
- Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks (Q4969697) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)
- An exact algorithm for the maximum quasi‐clique problem (Q6088204) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)