Decomposition of a hypergraph by partial-edge separators
type: Item
instance of: scholarly article
title: Decomposition of a hypergraph by partial-edge separators
zbMATH Open document ID: 0939.68089
DOI: 10.1016/S0304-3975(98)00128-5
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1454554
zbMATH Keywords: separator
zbMATH Keywords: decomposition
zbMATH Keywords: acyclicity
zbMATH Keywords: compaction
author: Francesco M. Malvestuto
author: Marina Moscarini
MaRDI profile type: Publication
cites work: Collapsibility and response variables in contingency tables
cites work: On the Desirability of Acyclic Database Schemes
cites work: Q3993087
cites work: Q4098510
cites work: Markov fields and log-linear interaction models for contingency tables
cites work: Q3883524
cites work: Q5572939
cites work: On the effective implementation of the iterative proportional fitting procedure
cites work: Q3315548
cites work: Optimal decomposition by clique separators
cites work: Computing the maximum-entropy extension of given discrete probability distributions
cites work: A fast algorithm for query optimization in universal-relation databases
cites work: Decomposition by clique separators
description: scientific article; zbMATH DE number 1454554