Minimal Representation of Directed Hypergraphs
From MaRDI portal
Recommendations
Cited in
(54)- A decomposition method for CNF minimality proofs
- Finding the \(K\) best policies in a finite-horizon Markov decision process
- Dynamic algorithms for classes of constraint satisfaction problems
- Dynamic maintenance of directed hypergraphs
- On the hydra number of disconnected graphs
- Attribute-incremental construction of the canonical implication basis
- Minimum difference representations of graphs
- A subclass of Horn CNFs optimally compressible in polynomial time
- On the complexity of strongly connected components in directed hypergraphs
- The ghosts of forgotten things: a study on size after forgetting
- Boolean functions with a simple certificate for CNF complexity
- Exclusive and essential sets of implicates of Boolean functions
- Partially dynamic maintenance of minimum weight hyperpaths
- The complexity of arc-colorings for directed hypergraphs
- Bidual Horn functions and extensions
- Algorithms for computing minimal equivalent subformulas
- On vertex independence number of uniform hypergraphs
- Dynamic maintenance of the transitive closure in disjunctive graphs
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Primitive tensors and directed hypergraphs
- Directed hypergraphs and applications
- Directed hypergraphs and Horn minimization
- Optimal covers in the relational database model
- A characterization of irreducible tensors by using the connectedness of the associated directed hypergraphs
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
- Hardness results for approximate pure Horn CNF formulae minimization
- Extension and equivalence problems for clause minimal formulae
- Boolean functions with long prime implicants
- Reconstructing a history of recombinations from a set of sequences
- Approximating minimum representations of key Horn functions
- Redundancy in logic. I: CNF propositional formulae
- Disjoint essential sets of implicates of a CQ Horn function
- scientific article; zbMATH DE number 3911762 (Why is no real title available?)
- scientific article; zbMATH DE number 3895108 (Why is no real title available?)
- Unique key Horn functions
- Amortized efficiency of a path retrieval data structure
- A hypergraph model for constraint logic programming and applications to bus drivers' scheduling
- The complexity of arc-colorings for directed hypergraphs
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Hydras: complexity on general graphs and a subclass of trees
- Hydras: directed hypergraphs and Horn formulas
- Succinctness and tractability of closure operator representations
- The joy of implications, aka pure Horn formulas: mainly a survey
- scientific article; zbMATH DE number 4057024 (Why is no real title available?)
- On-line algorithms for satisfiability problems with uncertainty
- Recognition of tractable DNFs representable by a constant number of intervals
- On-line algorithms for satisfiability problems with uncertainty
- On implicational bases of closure systems with unique critical sets.
- Convex geometries representable by at most five circles on the plane
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Redundancy in logic. III: Non-monotonic reasoning
- scientific article; zbMATH DE number 7527897 (Why is no real title available?)
- Linear connectivity problems in directed hypergraphs
- Properties of Switch-List Representations of Boolean Functions
This page was built for publication: Minimal Representation of Directed Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738576)
