Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Jüttner, Alpár"'
Autor:
Jüttner, Alpár, Király, Csaba, Mendoza-Cadena, Lydia Mirabel, Pap, Gyula, Schlotter, Ildikó, Yamaguchi, Yutaro
We consider the Shortest Odd Path problem, where given an undirected graph $G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the aim is to find an $(s,t)$-path with odd length and, among all such paths, of minimum weight. For
Externí odkaz:
http://arxiv.org/abs/2308.12653
Autor:
Jüttner, Alpár, Szabó, Eszter
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 edges. A min-max formula is given to the problem and an algorithm is prese
Externí odkaz:
http://arxiv.org/abs/2308.12404
Autor:
Jüttner, Alpár, Madarasi, Péter
This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all non-cospectral graph p
Externí odkaz:
http://arxiv.org/abs/2301.09187
Autor:
Jüttner, Alpár, Király, Csaba, Mendoza-Cadena, Lydia Mirabel, Pap, Gyula, Schlotter, Ildikó, Yamaguchi, Yutaro
Publikováno v:
In Discrete Applied Mathematics 15 November 2024 357:34-50
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Discrete Applied Mathematics 31 December 2018 251:93-102
Autor:
Jüttner, Alpár, Madarasi, Péter
Publikováno v:
In Discrete Applied Mathematics 19 June 2018 242:69-81
Publikováno v:
In Transportation Research Procedia 2017 27:1080-1087
Publikováno v:
In Theoretical Computer Science 5 October 2012 454:23-29
Publikováno v:
In European Journal of Operational Research 2005 164(2):456-474