The complexity of some problems on maximal independent sets in graphs
From MaRDI portal
Publication:5301767
Recommendations
- Integers for the number of maximal independent sets in graphs
- On graphs with the third largest number of maximal independent sets
- Graphs with the second largest number of maximal independent sets
- The second largest number of maximal independent sets in graphs with at most \(k\) cycles
- scientific article; zbMATH DE number 867639
Cited in
(15)- Computing maximum independent set on outerstring graphs and their relatives
- scientific article; zbMATH DE number 5842466 (Why is no real title available?)
- The complexity of dissociation set problems in graphs
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
- The Complexity of Finding Paths in Graphs with Bounded Independence Number
- MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
- The maximal \(f\)-dependent set problem for planar graphs is in NC
- Advice complexity of maximum independent set in sparse and bipartite graphs
- A simple proof that finding a maximal independent set in a graph is in NC
- scientific article; zbMATH DE number 5521219 (Why is no real title available?)
- The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
- An optimal maximal independent set algorithm for bounded-independence graphs
- scientific article; zbMATH DE number 1305522 (Why is no real title available?)
- The maximal f-dependent set problem for planar graphs is in NC
- On the complexity of the independent set problem in triangle graphs
This page was built for publication: The complexity of some problems on maximal independent sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301767)
