6 citations
8 papers
Optimizing Administrative Divisions: A Vertex -Center Approach for Edge-Weighted Road Graphs
Peteris Daugulis
Efficient and equitable access to municipal services hinges on well-designed administrative divisions. It requires ongoing adaptation to changing demographics, infrastructure, and…
A note on a generalization of eigenvector centrality for bipartite graphs and applications
Peteris Daugulis
Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector cent…
Nonuniqueness of semidirect decompositions for semidirect products with directly decomposable factors and applications for dihedral groups
Peteris Daugulis
Nonuniqueness of semidirect decompositions of groups is an insufficiently studied question in contrast to direct decompositions. We obtain some results about semidirect decompositi…
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…
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…
On coordinatization of mathematics
Peteris Daugulis
The problem of advancing coordinatization of mathematics is considered. The need to develop a theory for measuring value and complexity of mathematical implications and proofs is d…