Decomposition of a hypergraph by partial-edge separators

DOI10.1016/S0304-3975(98)00128-5zbMATH Open0939.68089MaRDI QIDQ1566705FDOQ1566705

Authors: Francesco M. Malvestuto, Marina Moscarini 

Publication date: 4 June 2000

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

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

zbMATH Keywords

decompositionacyclicitycompactionseparator

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Decomposition by clique separators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal decomposition by clique separators
• Title not available (Why is that?)
• On the Desirability of Acyclic Database Schemes
• Title not available (Why is that?)
• Markov fields and log-linear interaction models for contingency tables
• A fast algorithm for query optimization in universal-relation databases
• Collapsibility and response variables in contingency tables
• On the effective implementation of the iterative proportional fitting procedure
• Computing the maximum-entropy extension of given discrete probability distributions

Cited In (15)

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

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)