Sheaf cohomology on network codings: maxflow-mincut theorem

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