The Maxflow problem and a generalization to simplicial complexes
Combinatorics
2012-12-07 v1 Discrete Mathematics
Optimization and Control
Abstract
The problem of Maxflow is a widely developed subject in modern mathematics. Efficient algorithms exist to solve this problem, that is why a good generalization may permit these algorithms to be understood as a particular instance of solutions in a wider class of problems. In the last section we suggest a generalization in the context of simplicial complexes, that reduces to the problem of Maxflow in graphs, when we consider a graph as a simplicial complex of dimension 1.
Cite
@article{arxiv.1212.1406,
title = {The Maxflow problem and a generalization to simplicial complexes},
author = {Fabian Latorre},
journal= {arXiv preprint arXiv:1212.1406},
year = {2012}
}