A note on hypergraph decomposition based on extended minimal sets

DOI10.1007/BF02575948zbMath0679.05055MaRDI QIDQ1124611

S. Trivellini

Publication date: 1988

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

hypergraphem-setsExtended minimal setsnode partitionweighted arcs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy
• Circular Cuts in a Network
• Cutsets and partitions of hypergraphs

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