Pages that link to "Item:Q1108809"
From MaRDI portal
The following pages link to On generating all maximal independent sets (Q1108809):
Displaying 50 items.
- The maximum clique problem (Q1318271) (← links)
- Generating all maximal independent sets on trees in lexicographic order (Q1328528) (← links)
- Listing graphs that satisfy first-order sentences (Q1337473) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- Horn functions and submodular Boolean functions (Q1392203) (← links)
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Loopless Gray code enumeration and the Tower of Bucharest (Q1623270) (← links)
- Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
- Blocker size via matching minors (Q1637141) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Short rational generating functions for solving some families of fuzzy integer programming problems (Q1677650) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions (Q1732054) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- On detecting maximal quasi antagonistic communities in signed graphs (Q1741135) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← 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)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Decompositions of positive self-dual Boolean functions (Q1893164) (← links)
- Interior and exterior functions of Boolean functions (Q1923581) (← links)
- Fuzzy relational equations with min-biimplication composition (Q1927264) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Fast maximal cliques enumeration in sparse graphs (Q1949748) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Counting substrate cycles in topologically restricted metabolic networks (Q2011645) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- Minimal winning coalitions and orders of criticality (Q2095937) (← links)
