3 papers
math.OC2023
Balanced Submodular Flows
Alpár Jüttner, Eszter Szabó
This paper examines the Balanced Submodular Flow Problem, that is the problem of finding a feasible submodular flow minimizing the difference between the flow values along the edge…
cs.DS2023
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena +3
We consider the Shortest Odd Path problem, where given an undirected graph , a weight function on its edges, and two vertices and in , the aim is to find an -p…
cs.DS2023
A graph isomorphism invariant based on neighborhood aggregation
Alpár Jüttner, Péter Madarasi
This paper presents a new graph isomorphism invariant, called -labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism prob…