Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Query Efficient Weighted Stochastic Matching
Mahsa Derakhshan, Mohammad Saneian
In this paper, we study the weighted stochastic matching problem. Let be a given edge-weighted graph and let its realization be a random subgraph of th…
cs.DS2023
Streaming Edge Coloring with Asymptotically Optimal Colors
Soheil Behnezhad, Mohammad Saneian
Given a graph , an edge-coloring is an assignment of colors to edges of such that any two edges sharing an endpoint receive different colors. By Vizing's celebrated theorem,…