Algorithms for maximum independent sets
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Efficiency in exponential time for domination-type problems
- The maximum clique problem
- Which problems have strongly exponential complexity?
- Algorithmic problems in right-angled Artin groups: complexity and applications
- 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
- Algorithms for dominating clique problems
- Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set
- Faster exact solutions for some NP-hard problems.
- Graph separators: A parameterized view
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- Improved exact algorithms for MAX-SAT
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Exact algorithms for edge domination
- In search of the densest subgraph
- Exact algorithms for maximum independent set
- Maximum independent sets near the upper bound
- \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- A note on the fine-grained complexity of MIS on regular graphs
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
- Iterative compression and exact algorithms
- Layered graphs: applications and algorithms
- Combinatorial properties of Farey graphs
- Extending the MAX algorithm for maximum independent set
- Moderately exponential time algorithms for the maximum induced matching problem
- Faster exact algorithms for some terminal set problems
- Solving the maximum clique problem using a tabu search approach
- A multivariate framework for weighted FPT algorithms
- Exact algorithms for maximum induced matching
- Fast algorithms for max independent set
- On independent sets and bicliques in graphs
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Sharp separation and applications to exact and parameterized algorithms
- Nearly exact mining of frequent trees in large networks
- Heuristic algorithm for finding the maximum independent set
- An exact algorithm for the minimum dominating clique problem
- A note on the complexity of minimum dominating set
- Open problems around exact algorithms
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract)
- Components in time-varying graphs
- A simple algorithm to optimize maximum
- Exact Algorithms for Maximum Independent Set
- A faster algorithm for dominating set analyzed by the potential method
- Parameterized complexity and subexponential-time computability
- A fine-grained analysis of a simple independent set algorithm
- All maximal independent sets and dynamic dominance for sparse graphs
- Complement, complexity, and symmetric representation
- Large Induced Subgraphs via Triangulations and CMSO
- Exponential Time Complexity of Weighted Counting of Independent Sets
- New upper bounds for the problem of maximal satisfiability
- Largest chordal and interval subgraphs faster than \(2^n\)
- Maximum independent set for intervals by divide and conquer with pruning
- Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
- On CLIQUE Problem for Sparse Graphs of Large Dimension
- Exact Algorithms for Edge Domination
- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
- Streaming Algorithms for Independent Sets
- Iterative Compression and Exact Algorithms
- An algorithm for finding the independence number of a recursively generated hypergraph
- An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
- On testing monomials in multivariate polynomials
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- Solving min ones 2-SAT as fast as vertex cover
- Exact algorithms for dominating set
- scientific article; zbMATH DE number 1305487 (Why is no real title available?)
- scientific article; zbMATH DE number 733159 (Why is no real title available?)
- scientific article; zbMATH DE number 2079379 (Why is no real title available?)
- scientific article; zbMATH DE number 1508265 (Why is no real title available?)
- scientific article; zbMATH DE number 1522948 (Why is no real title available?)
- Molecular computing, bounded nondeterminism, and efficient recursion
- Confronting intractability via parameters
- scientific article; zbMATH DE number 3995720 (Why is no real title available?)
- scientific article; zbMATH DE number 2119675 (Why is no real title available?)
- scientific article; zbMATH DE number 847156 (Why is no real title available?)
- Auto-g-computation of causal effects on a network
- Mutex graphs and multicliques: reducing grounding size for planning
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Fast local search for the maximum independent set problem
- An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator
- Scalable kernelization for maximum independent sets
- On Independent Sets and Bicliques in Graphs
- Computing transparently: The independent sets in a graph
- A stronger model of dynamic programming algorithms
- Network decomposition and maximum independent set. II: Application research
- A branch and bound algorithm for the maximum clique problem
- A generalization of maximal independent sets
- On the complexity of k-SAT
- Algorithms for four variants of the exact satisfiability problem
- On the computational power of DNA
- Solving larger maximum clique problems using parallel quantum annealing
- An approximation algorithm for 3-Colourability
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
- Complementarity in finite quantum mechanics and computer-aided computations of complementary observables
- On the size of integer programs with bounded non-vanishing subdeterminants
- Variable neighborhood search for the maximum clique
This page was built for publication: Algorithms for maximum independent sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777476)
