scientific article; zbMATH DE number 1305487
From MaRDI portal
Publication:4252376
Recommendations
Cited in
(43)- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
- Pathwidth of cubic graphs and exact algorithms
- Computing independent sets in graphs with large girth
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- Improved exact algorithms for MAX-SAT
- Exact algorithms for maximum independent set
- Maximum independent sets near the upper bound
- A note on the fine-grained complexity of MIS on regular graphs
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Advice complexity of maximum independent set in sparse and bipartite graphs
- Partition into triangles on bounded degree graphs
- Fast algorithms for max independent set
- A note on the complexity of minimum dominating set
- Open problems around exact algorithms
- A 4D-sequencing approach for air traffic management
- Finding independent sets in unions of perfect graphs
- All maximal independent sets and dynamic dominance for sparse graphs
- On reducing maximum independent set to minimum satisfiability
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
- A bottom-up method and fast algorithms for Max Independent Set
- Algorithms for maximum independent sets
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- The \textsc{max quasi-independent set} problem
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Constructing concrete hard instances of the maximum independent set problem
- scientific article; zbMATH DE number 3893238 (Why is no real title available?)
- Fast local search for the maximum independent set problem
- Solving NP-Complete Problems with Quantum Search
- Homogeneous genetic algorithms
- Computing maximum independent set on outerstring graphs and their relatives
- Algorithms for four variants of the exact satisfiability problem
- Stability preserving transformations of graphs
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
- Dynamic parameterized problems
- On the maximum independent set problem in graphs of bounded maximum degree
- Strong computational lower bounds via parameterized complexity
- An efficient fixed-parameter algorithm for 3-hitting set
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
- An optimal maximal independent set algorithm for bounded-independence graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252376)
