scientific article

Sandra Sudarsky, James Abello, 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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (42)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ A review on algorithms for maximum clique problems ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ Subjective interestingness of subgraph patterns ⋮ Frequency-driven tabu search for the maximum \(s\)-plex problem ⋮ A biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ Online summarization of dynamic graphs using subjective interestingness for sequential data ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ LP-based dual bounds for the maximum quasi-clique problem ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ On maximum ratio clique relaxations ⋮ In search of dense subgraphs: How good is greedy peeling? ⋮ An exact algorithm for the maximum quasi‐clique problem ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Techniques for analyzing dynamic random graph models of web-like networks: An overview ⋮ The \textsc{max quasi-independent set} problem ⋮ Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems ⋮ Editing graphs into disjoint unions of dense clusters ⋮ Mixed Integer Programming for Searching Maximum Quasi-Bicliques ⋮ Distributed discovery of large near-cliques ⋮ On Fast Enumeration of Pseudo Bicliques ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ On detecting maximal quasi antagonistic communities in signed graphs ⋮ Micro-review synthesis for multi-entity summarization ⋮ Dense subgraphs in random graphs ⋮ An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem ⋮ Finding quasi core with simulated stacked neural networks ⋮ On the planarization of wireless sensor networks ⋮ Computing maximum \(k\)-defective cliques in massive graphs ⋮ A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems ⋮ A network-based data mining approach to portfolio selection via weighted clique relaxations ⋮ A branch-and-bound approach for maximum quasi-cliques ⋮ Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ Finding influential communities in networks with multiple influence types ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ Finding weighted \(k\)-truss communities in large networks ⋮ On the maximum small-world subgraph problem

This page was built for publication: