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 2023Show all

2 papers · 1 filter

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 $w$ -labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism prob…

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,…