126 citations · 136 across the 18 of their papers we have counts for
Showing q-bio.NCShow all
2 papers · 1 filter
q-bio.NC2014
Connectome graphs and maximum flow problems
Peteris Daugulis
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 incr…
q-bio.NC2014
Homomorphisms of connectome graphs
Peteris Daugulis
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fol…