Publication:4917827
From MaRDI portal
zbMath1307.68092MaRDI QIDQ4917827
Publication date: 2 May 2013
Full work available at URL: http://www.kybernetika.cz/content/2013/1/4
68W30: Symbolic computation and algebraic computation
68P15: Database theory
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
62A09: Graphical methods in statistics
Related Items
Cites Work
- Fast minimal triangulation algorithm using minimum degree criterion
- Connections in acyclic hypergraphs
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
- Existence of extensions and product extensions for discrete probability distributions
- From conditional independences to factorization constraints with discrete random variables
- On the Desirability of Acyclic Database Schemes
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Power of Natural Semijoins
- The generalized distributive law
- Factor graphs and the sum-product algorithm