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

DOI10.1007/BF02575680zbMATH Open0344.05149OpenAlexW2058699333MaRDI QIDQ1232425FDOQ1232425

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)

Cites Work

• Title not available (Why is that?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Multi-Terminal Network Flows
• Title not available (Why is that?)
• Cutsets and partitions of hypergraphs

Cited In (1)

• A note on hypergraph decomposition based on extended minimal sets

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

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