Madarasi Péter: Restricted $b$-Matchings and Subgraph Matchings

EGERVÁRY SZEMINÁRIUM

Absztrakt: The goal of this talk is to present my PhD thesis. The topics include
1) a restricted bipartite $b$-matching problem in which a cherry $s_i
t s_j$ is forbidden if $|i-j| \leq d$,
2) a restricted $b$-matching problem in which an edge set is feasible
if it satisfies multiple $b$-matching problems simultaneously,
2) graph isomorphism invariants based on neighborhood aggregation, and
3) practical algorithms for the graph and subgraph isomorphism problems.