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)- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Recognition and dualization of disguised bidual Horn functions.
- Counting and enumeration complexity with application to multicriteria scheduling
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Spanned patterns for the logical analysis of data
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Incremental delay enumeration: space and time
- A framework for the complexity of high-multiplicity scheduling problems
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- Satisfiability of mixed Horn formulas
- On Independent Sets and Bicliques in Graphs
- LoCo—A Logic for Configuration Problems
- Polynomial-delay construction of irreducible coverings of a Boolean matrix
- Querying disjunctive databases through nonmonotonic logics
- Generating clause sequences of a CNF formula
- Mining ℰℒ⊥ Bases with Adaptable Role Depth
- Parameterized enumeration for modification problems
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- The maximum clique problem
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Lower bounds for three algorithms for transversal hypergraph generation
- Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions
- Design and results of the second international competition on computational models of argumentation
- The Helly property and satisfiability of Boolean formulas defined on set families
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Generating all maximal models of a Boolean expression
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Interior and exterior functions of positive Boolean functions.
- On detecting maximal quasi antagonistic communities in signed graphs
- Enumerating homomorphisms
- Listing graphs that satisfy first-order sentences
- Bidual Horn functions and extensions
- Fixed points in conjunctive networks and maximal independent sets in graph contractions
- Finding kernels or solving SAT
- Enumeration of the perfect sequences of a chordal graph
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Transducing Markov sequences
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
- Generating all maximal independent sets on trees in lexicographic order
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
- Loopless Gray code enumeration and the Tower of Bucharest
- On vertex independence number of uniform hypergraphs
- Counting substrate cycles in topologically restricted metabolic networks
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
- Listing subgraphs by Cartesian decomposition
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- Parameterized edge dominating set in cubic graphs (extended abstract)
- Interior and exterior functions of Boolean functions
- Probably approximately correct learning of Horn envelopes from queries
- Generating all vertices of a polyhedron is hard
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Enumeration and maximum number of minimal connected vertex covers in graphs
- A general method for generating all maximal independent sets of a graph
- On two techniques of combining branching and treewidth
- Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Generating bicliques of a graph in lexicographic order
- Generating 3-vertex connected spanning subgraphs
- Computing and listing \(st\)-paths in public transportation networks
- Blocker size via matching minors
- Paradigms for parameterized enumeration
- Enumeration of support-closed subsets in confluent systems
- Enumerating minimal dominating sets in chordal bipartite graphs
- Algorithms for dominating clique problems
- Computing and listing \(st\)-paths in public transportation networks
- Decision lists and related Boolean functions
- Generate all maximal independent sets in permutation graphs
- Consensus algorithms for the generation of all maximal bicliques
- All maximal independent sets and dynamic dominance for sparse graphs
- On the Parameterized Complexity of Clique Elimination Distance
- A structure theorem for rooted binary phylogenetic networks and its implications for tree-based networks
- Extracting interval temporal logic rules: a first approach
- In search of the densest subgraph
- On the generation of circuits and minimal forbidden sets
- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Efficiently listing bounded length \(st\)-paths
- Mine 'em all: a note on mining all graphs
- On the dualization in distributive lattices and related problems
- On the Complexity of Computing Generators of Closed Sets
- Polynomial-delay generation of functional digraphs up to isomorphism
- An incremental algorithm for computing ranked full disjunctions
- Lattice point of view for argumentation framework
- Parameterized complexity of conflict-free set cover
- Efficient enumeration of graph orientations with sources
- Output-size sensitiveness of OBDD construction through maximal independent set problem
- Listing closed sets of strongly accessible set systems with applications to data mining
- New parameterized algorithms for the edge dominating set problem
- Generating minimal redundant and maximal irredundant subhypergraphs
- An inequality for polymatroid functions and its applications.
- Translating between the representations of a ranked convex geometry
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Enumerating maximal consistent closed sets in closure systems
- Constraints on the number of maximal independent sets in graphs
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)
