Sheaf cohomology on network codings: maxflow-mincut theorem

• Autores: Miradain Atontsa Nguemo, Calvin Tcheka
• Localización: Applied general topology, ISSN-e 1989-4147, ISSN 1576-9402, Vol. 18, Nº. 2, 2017, págs. 219-230
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.