A note on hypergraph decomposition based on extended minimal sets

DOI10.1007/BF02575948MaRDI QIDQ1124611zbMATH OpenFDO

Authors S. Trivellini

Publication date 1988

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02575948

zbMATH Keywords

em-setsExtended minimal setshypergraphnode partitionweighted arcs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Solution of one problem of optimal partition of the vertex set of a hypergraph
• A fast hypergraph min-cut algorithm for circuit partitioning
• An efficient algorithm for judicious partition of hypergraphs
• scientific article; zbMATH DE number 2075198
• Decomposition of a hypergraph by partial-edge separators

Cites work

• A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy
• Circular Cuts in a Network
• Cutsets and partitions of hypergraphs
• scientific article; zbMATH DE number 4039253 (Why is no real title available?)

Cited in

(1)

• Decomposition of a hypergraph by partial-edge separators

This page was built for publication: A note on hypergraph decomposition based on extended minimal sets

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