Connectome graphs and maximum flow problems
Neurons and Cognition
2014-12-22 v1 Computational Engineering, Finance, and Science
Abstract
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would increase the maximal flow. Initial computation results for some publicly available connectome graphs are described.
Cite
@article{arxiv.1412.6341,
title = {Connectome graphs and maximum flow problems},
author = {Peteris Daugulis},
journal= {arXiv preprint arXiv:1412.6341},
year = {2014}
}