Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams

Last updated 27th Jul 2017
Follow pinboard


A pinboard by Sumedh Tirodkar

Post Doctoral Fellow, School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India


Maximum Matching on graphs in the semi-streaming model

Maximum Matching in simple undirected graphs is a subset of maximum number of edges such that at most one edge is incident on any vertex. We study this problem in the semi-streaming model, in which...