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
- Publication:4486258
- Critical and maximum independent sets revisited
- Maximum independent sets near the upper bound
- Publication:4864968
Cites work
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- 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
Cited in
(only showing first 100 items - show all)- On Independent Sets and Bicliques in Graphs
- Listing graphs that satisfy first-order sentences
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Constraints on the number of maximal independent sets in graphs
- The number of maximal independent sets in connected triangle-free graphs
- Decision lists and related Boolean functions
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
- Consensus algorithms for the generation of all maximal bicliques
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Generating dual-bounded hypergraphs
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Lower bounds for three algorithms for transversal hypergraph generation
- A new decomposition technique for maximal clique enumeration for sparse graphs
- On two techniques of combining branching and treewidth
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- On generating all solutions of generalized satisfiability problems
- On vertex independence number of uniform hypergraphs
- Solving the maximum clique problem using a tabu search approach
- Fuzzy relational equations with min-biimplication composition
- Generating bicliques of a graph in lexicographic order
- Probably approximately correct learning of Horn envelopes from queries
- Enumerating homomorphisms
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
- Spanned patterns for the logical analysis of data
- Counting and enumeration complexity with application to multicriteria scheduling
- Computational aspects of monotone dualization: a brief survey
- Double Horn functions
- Iterative compression and exact algorithms
- Generating cut conjunctions in graphs and related problems
- New parameterized algorithms for the edge dominating set problem
- Finding kernels or solving SAT
- Generating all maximal models of a Boolean expression
- Horn functions and submodular Boolean functions
- Graph theoretical structures in logic programs and default theories
- Exact Algorithms for Edge Domination
- Scheduling modular projects on a bottleneck resource
- Enumeration of minimal dominating sets and variants
- Complexity of learning in concept lattices from positive and negative examples
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Completing causal networks by meta-level abduction
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Enumeration of the perfect sequences of a chordal graph
- Parallel algorithm for computing fixpoints of Galois connections
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Forms of representation for simple games: sizes, conversions and equivalences
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- Generating all vertices of a polyhedron is hard
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Parameterized edge dominating set in graphs with degree bounded by 3
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- Maximal independent sets in caterpillar graphs
- Graphs with the second largest number of maximal independent sets
- Multiplicity and complexity issues in contemporary production scheduling
- All maximal independent sets and dynamic dominance for sparse graphs
- On the complexity of enumerating pseudo-intents
- Counting truth assignments of formulas of bounded tree-width or clique-width
- NP-completeness: a retrospective
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Exact algorithms for edge domination
- Fast maximal cliques enumeration in sparse graphs
- Enumeration aspects of maximal cliques and bicliques
- Comparing performance of algorithms for generating concept lattices
- Enumerating minimal dominating sets in chordal bipartite graphs
- A framework for the complexity of high-multiplicity scheduling problems
- The maximum clique problem
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Parameterized edge dominating set in cubic graphs (extended abstract)
- On the generation of circuits and minimal forbidden sets
- Counting and enumerating preferred database repairs
- On maximal chain subgraphs and covers of bipartite graphs
- Version spaces and the consistency problem
- An exact algorithm for the minimum dominating clique problem
- Decompositions of positive self-dual Boolean functions
- A refined exact algorithm for edge dominating set
- Recognition and dualization of disguised bidual Horn functions.
- On enumerating all minimal solutions of feedback problems
- Computing and listing \(st\)-paths in public transportation networks
- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- Blocker size via matching minors
- Querying disjunctive databases through nonmonotonic logics
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy.
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Generating 3-vertex connected spanning subgraphs
- Generating all maximal independent sets on trees in lexicographic order
- Maximum weight edge-constrained matchings
- Listing closed sets of strongly accessible set systems with applications to data mining
- On the complexity of the dualization problem
- Interior and exterior functions of Boolean functions
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- An inequality for polymatroid functions and its applications.
- On the Complexity of Computing Generators of Closed Sets
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)
