Finding a Maximum Independent Set

Cited in

(87)

Nondeterministic graph searching: from pathwidth to treewidth
Pathwidth of cubic graphs and exact algorithms
Combinatorial analysis (nonnegative matrices, algorithmic problems)
Solving NP-hard problems in 'almost trees': vertex cover
Average polynomial time complexity of some NP-complete problems
On finding a minimum dominating set in a tournament
An algorithm for finding a maximum clique in a graph
The maximum clique problem
Enumerating all connected maximal common subgraphs in two graphs
Which problems have strongly exponential complexity?
On comparing algorithms for the maximum clique problem
A refined algorithm for maximum independent set in degree-4 graphs
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
Faster exact solutions for some NP-hard problems.
Exact algorithms for edge domination
Exact algorithms for maximum independent set
New models and algorithms for RNA pseudoknot order assignment
Moderate exponential-time algorithms for scheduling problems
Unsupervised feature selection for efficient exploration of high dimensional data
Discrete dynamical system approaches for Boolean polynomial optimization
Vertex coloring of a graph for memory constrained scenarios
Iterative compression and exact algorithms
Layered graphs: applications and algorithms
Solving the maximum clique problem using a tabu search approach
Treewidth computation and extremal combinatorics
Sharp separation and applications to exact and parameterized algorithms
New exact algorithms for the 2-constraint satisfaction problem
An exact algorithm for the minimum dominating clique problem
A note on the complexity of minimum dominating set
Genetic algorithmic approach to find the maximum weight independent set of a graph
Open problems around exact algorithms
On the computational hardness based on linear fpt-reductions
Parameterized computation and complexity: a new approach dealing with NP-hardness
Reinforcement learning for combinatorial optimization: a survey
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract)
Components in time-varying graphs
Large Induced Subgraphs via Triangulations and CMSO
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
On the probable behaviour of some algorithms for finding the stability number of a graph
Exponential Time Complexity of Weighted Counting of Independent Sets
An algorithm for finding a maximum weighted independent set in an arbitrary graph
Path contraction faster than 2ⁿ
Exact Algorithms for Edge Domination
Iterative Compression and Exact Algorithms
Determining the number of internal stability of a graph
An algorithm for the maximum internally stable set in a weighted graph
On vertex independence number of uniform hypergraphs
A global optimization approach for solving the maximum clique problem
Exact algorithms for dominating set
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Fuzzy graphs and networks repairs
scientific article; zbMATH DE number 1508265 (Why is no real title available?)
Branch-and-bound techniques for the maximum planar subgraph problem^∗
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
A faster algorithm for maximum independent set on interval filament graphs
Path Contraction Faster Than 2^n
Solving NP-Complete Problems with Quantum Search
Graph theory (algorithmic, algebraic, and metric problems)
Homogeneous genetic algorithms
A branch and bound algorithm for the maximum clique problem
Hard graphs for the maximum clique problem
A branch and bound algorithm for the maximum clique problem
On the complexity of k-SAT
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
On the computational power of DNA
MIP formulations for induced graph optimization problems: a tutorial
An approximation algorithm for 3-Colourability
A differentiable approach to the maximum independent set problem using dataless neural networks
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
Complementarity in finite quantum mechanics and computer-aided computations of complementary observables
Exact algorithms for the maximum k-balanced weighted biclique problem
Multi-task representation learning for mixed integer linear programming
On the size of integer programs with bounded non-vanishing subdeterminants
Moderate exponential-time algorithms for scheduling problems
Graph polynomials and local graph operations
Faster exponential algorithms for cut problems via geometric data structures
Improved simulation of nondeterministic Turing machines
Finding maximum cliques in arbitrary and in special graphs
Strong computational lower bounds via parameterized complexity
The worst-case time complexity for generating all maximal cliques and computational experiments
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
An efficient fixed-parameter algorithm for 3-hitting set
An exact algorithm for maximum independent set in degree-5 graphs
An exact algorithm for the maximum clique problem
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Finding a dominating set on bipartite graphs

This page was built for publication: Finding a Maximum Independent Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133117)