A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy
From MaRDI portal
Publication:1232425
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
Related Items (1)
Cites Work
This page was built for publication: A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy