Resumen de Sheaf cohomology on network codings: maxflow-mincut theorem

Miradain Atontsa Nguemo, Calvin Tcheka

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