Work

A simple algorithm to find maximum matching for complete graph and complete bipartite graph: using incidence matrix approach

Year: 2016
Type: article
Language: English
Open Access status: closed
OpenAlex ID: W2275898331
FWCI:
Cites:
Cited by:
Related to: 10