research
∙
01/03/2023
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST
In this paper, we reduce the maximum weighted matching problem to the la...
share
research
∙
09/27/2020
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring o...
research
∙
08/17/2020
Sublinear bounds for nullity of flows and approximating Tutte's flow conjectures
A function f:N→ N is sublinear, if lim_x→ +∞f(x)/x=0. If A is ...
research
∙
04/26/2019
