Nabamita Pal

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Determining maximum matching in any network has always been a problem of immense concern. Its solution is a necessary requirement in structural control theory for controlling real world complex networks. The prevalent classical approach through the Hopcroft-Karp algorithm and other proposed algorithms require the determination of the bipartite equivalent(More)
  • 1