Recommendations
- A generalization of maximal independent sets
- On the maximum number of maximum independent sets
- A general method for generating all maximal independent sets of a graph
- scientific article; zbMATH DE number 637355
- Generating all maximal independent sets on trees in lexicographic order
- Maximizing the number of independent sets of a fixed size
- scientific article; zbMATH DE number 1465674
- Critical and maximum independent sets revisited
- Maximum independent sets near the upper bound
- scientific article; zbMATH DE number 847156
Cites work
- A New Algorithm for Generating All the Maximal Independent Sets
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- How to assign votes in a distributed system
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
Cited in
(only showing first 100 items - show all)- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- On two techniques of combining branching and treewidth
- Combinatorial optimization in system configuration design
- Enumeration aspects of maximal cliques and bicliques
- Lower bounds for three algorithms for transversal hypergraph generation
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Double Horn functions
- The number of maximal independent sets in connected triangle-free graphs
- The maximum clique problem
- Generating all maximal independent sets on trees in lexicographic order
- Listing graphs that satisfy first-order sentences
- On enumerating all minimal solutions of feedback problems
- Querying disjunctive databases through nonmonotonic logics
- Horn functions and submodular Boolean functions
- Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
- Interior and exterior functions of positive Boolean functions.
- An inequality for polymatroid functions and its applications.
- Loopless Gray code enumeration and the Tower of Bucharest
- Computing and listing \(st\)-paths in public transportation networks
- Blocker size via matching minors
- Efficient enumeration of graph orientations with sources
- Short rational generating functions for solving some families of fuzzy integer programming problems
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- A new decomposition technique for maximal clique enumeration for sparse graphs
- On detecting maximal quasi antagonistic communities in signed graphs
- Algorithms for dominating clique problems
- On the generation of circuits and minimal forbidden sets
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Recognition and dualization of disguised bidual Horn functions.
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Complexity of learning in concept lattices from positive and negative examples
- Decompositions of positive self-dual Boolean functions
- Interior and exterior functions of Boolean functions
- Fuzzy relational equations with min-biimplication composition
- Exact algorithms for edge domination
- Parameterized random complexity
- Fast maximal cliques enumeration in sparse graphs
- Bidual Horn functions and extensions
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Inner-core and outer-core functions of partially defined Boolean functions
- Efficiently enumerating minimal triangulations
- Efficient enumeration of maximal induced bicliques
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- In search of the densest subgraph
- Counting substrate cycles in topologically restricted metabolic networks
- On the dualization in distributive lattices and related problems
- Translating between the representations of a ranked convex geometry
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Minimal winning coalitions and orders of criticality
- Enumerating maximal consistent closed sets in closure systems
- Enumeration of support-closed subsets in confluent systems
- Solving a constrained economic lot size problem by ranking efficient production policies
- Enumerating teams in first-order team logics
- Counting and enumerating preferred database repairs
- Generating clause sequences of a CNF formula
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Iterative compression and exact algorithms
- Incremental delay enumeration: space and time
- On the logical analysis of partially ordered data in the supervised classification problem
- Probably approximately correct learning of Horn envelopes from queries
- Design and results of the second international competition on computational models of argumentation
- How we designed winning algorithms for abstract argumentation and which insight we attained
- A new approximate cluster deletion algorithm for diamond-free graphs
- Resolution based algorithms for the transversal hypergraph generation problem
- Finding maximal independent elements of products of partial orders (the case of chains)
- Asymptotically optimal dualization algorithms
- Fixed points in conjunctive networks and maximal independent sets in graph contractions
- Solving the maximum clique problem using a tabu search approach
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Paradigms for parameterized enumeration
- Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Parallel algorithm for computing fixpoints of Galois connections
- Closure-based constraints in formal concept analysis
- An exact algorithm for the minimum dominating clique problem
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Maximum weight edge-constrained matchings
- Spanned patterns for the logical analysis of data
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- A framework for the complexity of high-multiplicity scheduling problems
- Enumeration of irredundant forests
- Maximal independent sets in clique-free graphs
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- One approach to decoding monotone logical function
- Parameterized enumeration for modification problems
- On maximal chain subgraphs and covers of bipartite graphs
- Mine 'em all: a note on mining all graphs
- Efficient reasoning for inconsistent Horn formulae
This page was built for publication: On generating all maximal independent sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108809)
