Pages that link to "Item:Q2491763"

The following pages link to Clique-detection models in computational biochemistry and genomics (Q2491763):

Displaying 50 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)
• Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
• Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
• Optimizing experimental design in genetics (Q353179) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• Co-2-plex polynomials (Q411251) (← links)
• Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
• An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
• Refined pivot selection for maximal clique enumeration in graphs (Q899307) (← links)
• Reactive and dynamic local search for max-clique: engineering effective building blocks (Q1038292) (← links)
• Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
• A new upper bound for the maximum weight clique problem (Q1754725) (← links)
• Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
• An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
• A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
• Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
• Multi-attribute community detection in international trade network (Q2129400) (← 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 integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
• Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
• Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
• Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
• Algorithms for the generalized independent set problem based on a quadratic optimization approach (Q2329644) (← links)
• An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
• All roads lead to Rome -- new search methods for the optimal triangulation problem (Q2375332) (← links)
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
• Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
• Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
• Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
• An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
• An analysis of parameter adaptation in reactive tabu search (Q4979993) (← links)
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
• Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (Q5475729) (← links)
• Enumerating Isolated Cliques in Synthetic and Financial Networks (Q5505678) (← links)
• Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)
• On atomic cliques in temporal graphs (Q6043101) (← links)