Péter Madarasi

activity

20192026

most citedMatchings under distance constraints I

2 citations · 2 across the 15 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

Complexity, approximation, and extension of proper ${a, b}$ -edge-weightings

Péter Madarasi, Máté Simon

For distinct integers $a$ and $b$ , an ${a, b}$ -edge-weighting assigns $a$ or $b$ to each edge and labels each vertex by the sum of its incident weights. Such a weighting is proper…

cs.DM2023

Matchings under distance constraints II

Péter Madarasi

This paper introduces the \emph{ $d$ -distance $b$ -matching problem}, in which we are given a bipartite graph $G = (S, T; E)$ with $S = {s_{1}, \dots, s_{n}}$ , a weight function on the edges,…

Complexity, approximation, and extension of proper {a,b}-edge-weightings

Matchings under distance constraints II

Complexity, approximation, and extension of proper ${a, b}$ -edge-weightings