3 papers
math.CO2025
Separable convex optimization over indegree polytopes
Nóra A. Borsik, Péter Madarasi
We study egalitarian (acyclic) orientations of undirected graphs under indegree-based objectives, such as minimizing the -sum of indegrees for a strictly convex function , de…
math.CO2025
Vertex-ordering and arc-partitioning problems
Nóra A. Borsik, Péter Madarasi
We study vertex-ordering problems in loop-free digraphs subject to constraints on the left-going arcs, focusing on existence conditions and computational complexity. As an intrigui…
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…