Sheaf cohomology on network codings : maxflow-mincut theorem
(2017) Applied General Topology — Vol. 18, n° 2, p. 219-230 (2017)
Files
No attached file found for this publication.
Details
- Authors
- 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. Further- more,we establish the maxflow-mincut theorem with network coding sheaves in the case of multiple source.
- Affiliations
Citations
Atontsa Nguemo, M., & Tcheka, C. (2017). Sheaf cohomology on network codings : maxflow-mincut theorem. Applied General Topology, 18(2), 219-230. https://doi.org/10.4995/agt.2017.3371 (Original work published 2017)