Pages that link to "Item:Q3890128"

The following pages link to Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms (Q3890128):

Displaying 50 items.

• On the completability of incomplete orthogonal Latin rectangles (Q267209) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Unranking of small combinations from large sets (Q473209) (← 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)
• 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)
• Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
• Interesting pattern mining in multi-relational data (Q740605) (← links)
• A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
• Version spaces and the consistency problem (Q814597) (← links)
• Listing closed sets of strongly accessible set systems with applications to data mining (Q844900) (← links)
• A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
• The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
• Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
• Generating cut conjunctions in graphs and related problems (Q930604) (← links)
• Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
• Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
• On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
• Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
• Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
• Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
• On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
• Minimum partition of an independence system into independent sets (Q1013303) (← links)
• Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
• On generating all maximal independent sets (Q1108809) (← links)
• A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909) (← links)
• The maximum clique problem (Q1318271) (← links)
• Generating all maximal independent sets on trees in lexicographic order (Q1328528) (← links)
• On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
• Horn functions and submodular Boolean functions (Q1392203) (← links)
• An inequality for polymatroid functions and its applications. (Q1410680) (← links)
• Cograph generation with linear delay (Q1694670) (← links)
• Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
• Detecting anomaly collections using extreme feature ranks (Q1715864) (← links)
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
• On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
• Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
• Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
• Interior and exterior functions of Boolean functions (Q1923581) (← links)
• Exact algorithms for edge domination (Q1945174) (← links)
• Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
• Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
• Efficiently enumerating minimal triangulations (Q1983135) (← links)
• Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
• Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
• On the complexity of solution extension of optimization problems (Q2072063) (← links)
• Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
• Enumeration of support-closed subsets in confluent systems (Q2134743) (← links)