The clique minimal separator decomposition of a hypergraph

MaRDI QIDQ4966374zbMATH OpenFDO

Authors Valentina Vladimirovna Bykova

Publication date 18 March 2021

Full work available at URL http://mathnet.ru/eng/jsfu217

zbMATH Keywords

treewidthacyclicityclique separatoratom hypergraph

Mathematics Subject Classification ID

Combinatorics (05-XX) Mathematical logic and foundations (03-XX)

Recommendations

• An introduction to clique minimal separator decomposition
• Decomposition of a hypergraph by partial-edge separators
• Optimal decomposition by clique separators
• scientific article; zbMATH DE number 3845624
• Organizing the atoms of the clique separator decomposition into an atom tree

Cites work

• scientific article; zbMATH DE number 3480648 (Why is no real title available?)
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• Algorithmic Aspects of Vertex Elimination on Graphs
• Decomposition by clique separators
• Maximum cardinality search for computing minimal triangulations of graphs
• On rigid circuit graphs
• Optimal decomposition by clique separators
• SOFSEM 2005: Theory and Practice of Computer Science

Cited in

(5)

• The decomposition problem for the set of paths in a directed graph and its application
• scientific article; zbMATH DE number 3845624 (Why is no real title available?)
• Decomposition of a hypergraph by partial-edge separators
• Characterizing atoms that result from decomposition by clique separators
• Clique based centrality measure in hypergraphs

This page was built for publication: The clique minimal separator decomposition of a hypergraph

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