Saran Krishnaswamy

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
This paper discusses an approach to generate all permutations and combinations of valid matching edges, valid pass-through edges and un-matched edges of a Bipartite graph (B-graph). Matchings would range from no-match to perfect-match. B-graph is represented as matrix where rows and columns represent two disjoint sets of vertex and its values represent the(More)
This paper discusses an approach to solve the maximum matching problem in Bipartite graph (B-graph) where the graph is partially matched and the existing matches cannot be changed. It uses the approach of choosing vertices for matching based on the run-time weight calculation. Vertex with highest weight is given preference for matching. Weights are assigned(More)
  • 1