scientific article; zbMATH DE number 1931696
From MaRDI portal
Publication:4708957
zbMath1013.68143MaRDI QIDQ4708957
Publication date: 20 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2424/24240549.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27)
Related Items (31)
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction ⋮ The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Blocker size via matching minors ⋮ Minimum implicational basis for \(\wedge\)-semidistributive lattices ⋮ On the fixed-parameter tractability of the equivalence test of monotone normal forms ⋮ Simple graphs in granular computing ⋮ Logic-based argumentation with existential rules ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ Persistent hyperdigraph homology and persistent hyperdigraph Laplacians ⋮ On the complexity of enumerating pseudo-intents ⋮ Output-polynomial enumeration on graphs of bounded (local) linear MIM-width ⋮ Counting minimal transversals of \(\beta\)-acyclic hypergraphs ⋮ Some Complexity Results about Essential Closed Sets ⋮ Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Self-duality of bounded monotone Boolean functions and related problems ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms ⋮ Algorithms for computing minimal unsatisfiable subsets of constraints ⋮ A study on monotone self-dual Boolean functions ⋮ On the fractional chromatic number of monotone self-dual Boolean functions ⋮ Join on Closure Systems Using Direct Implicational Basis Representation ⋮ Enumeration of Minimal Dominating Sets and Variants ⋮ Enumerating Minimal Dominating Sets in Triangle-Free Graphs ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ Combinatorial optimization in system configuration design ⋮ Lower bounds for three algorithms for transversal hypergraph generation ⋮ Zeon and idem-Clifford formulations of hypergraph problems ⋮ Exact and Approximate Minimal Pattern Mining ⋮ An average study of hypergraphs and their minimal transversals
This page was built for publication:
