Pages that link to "Item:Q1108809"

The following pages link to On generating all maximal independent sets (Q1108809):

Displaying 50 items.

• Generating all maximal models of a Boolean expression (Q294760) (← links)
• Completing causal networks by meta-level abduction (Q374193) (← links)
• On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
• Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
• New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
• Scheduling modular projects on a bottleneck resource (Q398901) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Finding kernels or solving SAT (Q414435) (← links)
• Enumerating homomorphisms (Q414933) (← links)
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
• A refined exact algorithm for edge dominating set (Q477194) (← links)
• An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
• Generating bicliques of a graph in lexicographic order (Q557825) (← links)
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph (Q602684) (← links)
• Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
• On the complexity of enumerating pseudo-intents (Q628340) (← links)
• Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
• Graph theoretical structures in logic programs and default theories (Q672050) (← links)
• Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
• Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
• Maximal independent sets in caterpillar graphs (Q765369) (← links)
• An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
• Version spaces and the consistency problem (Q814597) (← links)
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
• Listing closed sets of strongly accessible set systems with applications to data mining (Q844900) (← links)
• An incremental algorithm for computing ranked full disjunctions (Q882441) (← links)
• Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
• Computing maximal cliques in link streams (Q897884) (← links)
• Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
• Generating cut conjunctions in graphs and related problems (Q930604) (← links)
• Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
• Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
• On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
• Polynomial-delay construction of irreducible coverings of a Boolean matrix (Q960711) (← links)
• The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
• Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
• Satisfiability of mixed Horn formulas (Q997066) (← links)
• Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
• Graphs with the second largest number of maximal independent sets (Q998481) (← links)
• Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
• On two techniques of combining branching and treewidth (Q1022343) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
• Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
• STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
• Double Horn functions (Q1271644) (← links)
• The number of maximal independent sets in connected triangle-free graphs (Q1292823) (← links)