Control of Directed Hypergraphs through Hyperpath Deletion

Abstract

Hypergraphs and optimization in practical situations are being used as an eective method for solving complex problems and improving system performance. This study presents a novel approach for the removal of a hyperpath in a directed hypergraph for improved eciency. The proposed algorithm modies the vertices and hyperarcs in a two phases process to eectively eliminate the targeted hyperpath in an optimal way.