The following pages link to Finding a Maximum Independent Set (Q4133117):
Displaying 50 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- An exact algorithm for the maximum clique problem (Q922964) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- Average polynomial time complexity of some NP-complete problems (Q1091815) (← links)
- On finding a minimum dominating set in a tournament (Q1113678) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- The maximum clique problem (Q1318271) (← links)
- Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- New models and algorithms for RNA pseudoknot order assignment (Q2023637) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Unsupervised feature selection for efficient exploration of high dimensional data (Q2140450) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Genetic algorithmic approach to find the maximum weight independent set of a graph (Q2471331) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
