In 1982, Papadimitriou and Yannakakis introduced the Exact Matching (EM) problem where
given an edge colored graph, with colors red and blue, and an integer $ k $, the goal is to …

In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of
its edges with two colors (red and blue), as well as a positive integer $ k $. The task is then …

Given an integer k and a graph where every edge is colored either red or blue, the goal of
the exact matching problem is to find a perfect matching with the property that exactly k of its …

A red-blue graph is a graph where every edge is colored either red or blue. The exact
perfect matching problem asks for a perfect matching in a red-blue graph that has exactly a …

In the Exact Matching problem, we are given a graph whose edges are colored red or blue
and the task is to decide for a given integer k, if there is a perfect matching with exactly k red …

We consider a matching problem, which is meaningful in team competitions, as well as in
information theory, recommender systems, and assignment problems. In the competitions …

Given three n by n integer matrices A, B, and P, determining whether the product AB equals
P can be done in randomized O (n 2) time by Freivalds' algorithm. In this paper, we consider …

The exact matching problem is a constrained variant of the maximum matching problem:
given a graph with each edge having a weight 0 or 1 and an integer 𝑘, the goal is to find a …

This thesis deals with graph problems that are solvable in randomized polynomial time but
no deterministic algorithm exists for them. The central problem we focus on is the Exact …

The graphical realization of a given degree sequence and given partition adjacency matrix
simultaneously, is a relevant problem in data driven modeling of networks. Here we …