Decomposition of a hypergraph by partial-edge separators
From MaRDI portal
Publication:1566705
DOI10.1016/S0304-3975(98)00128-5zbMath0939.68089MaRDI QIDQ1566705
Marina Moscarini, Francesco Mario Malvestuto
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (8)
Local computations of the iterative proportional scaling procedure for hierarchical models ⋮ Equivalence between hypergraph convexities ⋮ Unnamed Item ⋮ Decomposable convexities in graphs and hypergraphs ⋮ Hierarchical subspace models for contingency tables ⋮ A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models ⋮ Canonical and monophonic convexities in hypergraphs ⋮ An implementation of the iterative proportional fitting procedure by propagation trees.
Cites Work
- On the effective implementation of the iterative proportional fitting procedure
- Computing the maximum-entropy extension of given discrete probability distributions
- Decomposition by clique separators
- Markov fields and log-linear interaction models for contingency tables
- A fast algorithm for query optimization in universal-relation databases
- Optimal decomposition by clique separators
- On the Desirability of Acyclic Database Schemes
- Collapsibility and response variables in contingency tables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposition of a hypergraph by partial-edge separators