Sheaf cohomology on network codings: maxflow-mincut theorem

Abstract

Surveying briefly a novel algebraic topological application sheaf theory into directed network coding problems, we obtain the weak duality in multiple source scenario by using the idea of modified graph. Furthermore,we establish the maxflow-mincut theorem with network coding sheaves in the case of multiple source.

Keywords

• network information flow
• network coding sheaves
• topological cut
• relative sheaf cohomology.