Pages that link to "Item:Q3013924"

The following pages link to Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (Q3013924):

Displaying 50 items.

• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
• The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
• Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
• Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• Social structure optimization in team formation (Q342472) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• Co-2-plex polynomials (Q411251) (← links)
• Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
• On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
• A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
• Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542) (← 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)
• On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
• Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• Enhancing quantum annealing performance for the molecular similarity problem (Q1679285) (← links)
• The maximum clique interdiction problem (Q1735171) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
• Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
• Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
• Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
• An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• Optimization problems for the maximum \(k\)-plex (Q2103796) (← links)
• An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
• CrawISN: community-aware data acquisition with maximum willingness in online social networks (Q2212525) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) (← links)
• An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
• Graph signatures: identification and optimization (Q2242325) (← links)
• The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• The triangle \(k\)-club problem (Q2359790) (← links)
• Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
• Discovery of extreme events-related communities in contrasting groups of physical system networks (Q2441822) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
• Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)