Sheaf cohomology on network codings: maxflow-mincut theorem
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 m...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitat Politècnica de València
2017-10-01
|
| Series: | Applied General Topology |
| Subjects: | |
| Online Access: | https://polipapers.upv.es/index.php/AGT/article/view/3371 |