A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy

DOI10.1007/BF02575680zbMath0344.05149OpenAlexW2058699333MaRDI QIDQ1232425

Piero Maestrini, Giuseppe Alia

Publication date: 1976

Published in: Calcolo (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (1)

A note on hypergraph decomposition based on extended minimal sets

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-Terminal Network Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Cutsets and partitions of hypergraphs

This page was built for publication: A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy