1 paper · 1 filter
Sahab Hajebi, Ramin Javadi
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph…