Connectome graphs and maximum flow problems
Peteris Daugulis
TL;DR
This paper explores maximum flow problems in connectome graphs, proposing computational challenges like identifying vertex pairs with maximal flow and potential new edges to enhance flow, supported by initial computational results.
Contribution
It introduces specific maximum flow problems tailored to connectome graphs and provides initial computational results for these problems.
Findings
Identified vertex pairs with maximal flow in connectome graphs
Suggested new edges to increase maximum flow
Presented initial computational results on real connectome data
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Distributed systems and fault tolerance · Optimization and Search Problems