scientific article; zbMATH DE number 2086259
From MaRDI portal
Publication:3044359
zbMATH Open1059.68597MaRDI QIDQ3044359FDOQ3044359
Authors: James Abello, Sandra Sudarsky, Mauricio G. C. Resende 
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2286/22860598.htm
Title of this publication is not available (Why is that?)
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (46)
- The \textsc{max quasi-independent set} problem
- Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks
- On the maximum small-world subgraph problem
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- 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
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
- Dense subgraphs in random graphs
- Computing maximum \(k\)-defective cliques in massive graphs
- MIP formulations for induced graph optimization problems: a tutorial
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Frequency-driven tabu search for the maximum \(s\)-plex 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
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Asymptotic bounds for clustering problems in random graphs
- Subjective interestingness of subgraph patterns
- On maximum ratio clique relaxations
- LP-based dual bounds for the maximum quasi-clique problem
- Subgraph detection
- Finding influential communities in networks with multiple influence types
- SQBC: an efficient subgraph matching method over large and dense graphs
- 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
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- Finding weighted \(k\)-truss communities in large networks
- 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
- An exact algorithm for the maximum quasi‐clique problem
- Multivariate algorithmics for finding cohesive subnetworks
- 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)
