Decomposition of a hypergraph by partial-edge separators

DOI10.1016/S0304-3975(98)00128-5MaRDI QIDQ1566705zbMATH OpenFDO

Authors Francesco M. Malvestuto, Marina Moscarini

Publication date 4 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(98)00128-5

zbMATH Keywords

acyclicitycompactiondecompositionseparator

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The clique minimal separator decomposition of a hypergraph
• A note on hypergraph decomposition based on extended minimal sets
• Computing partial hypergraphs of bounded width
• scientific article; zbMATH DE number 718859
• An Algorithm for the Modular Decomposition of Hypergraphs

Cites work

• A fast algorithm for query optimization in universal-relation databases
• Collapsibility and response variables in contingency tables
• Computing the maximum-entropy extension of given discrete probability distributions
• Decomposition by clique separators
• scientific article; zbMATH DE number 3845624 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3519741 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Markov fields and log-linear interaction models for contingency tables
• On the Desirability of Acyclic Database Schemes
• On the effective implementation of the iterative proportional fitting procedure
• Optimal decomposition by clique separators

Cited in

(16)

• Canonical and monophonic convexities in hypergraphs
• A note on hypergraph decomposition based on extended minimal sets
• The partition of a uniform hypergraph into pairs of dependent hyperedges
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• An implementation of the iterative proportional fitting procedure by propagation trees.
• Local computations of the iterative proportional scaling procedure for hierarchical models
• Decomposable convexities in graphs and hypergraphs
• scientific article; zbMATH DE number 5818908 (Why is no real title available?)
• On some partitions of hypergraphs and cumulants having applications in statistical mechanics
• scientific article; zbMATH DE number 4202276 (Why is no real title available?)
• A localization approach to improve iterative proportional scaling in Gaussian graphical models
• Equivalence between hypergraph convexities
• scientific article; zbMATH DE number 718859 (Why is no real title available?)
• Decompositions of multigraphs into parts with two edges
• The clique minimal separator decomposition of a hypergraph
• Hierarchical subspace models for contingency tables

This page was built for publication: Decomposition of a hypergraph by partial-edge separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566705)