A simple algorithm to find maximum matching for complete graph and complete bipartite graph: using incidence matrix approach
J. Math. Comput. Sci., 6 (2016), 272-280
J. Math. Comput. Sci., 6 (2016), 272-280
J. Math. Comput. Sci., 6 (2016), 262-271
J. Math. Comput. Sci., 6 (2016), 254-261
J. Math. Comput. Sci., 6 (2016), 247-253
J. Math. Comput. Sci., 6 (2016), 235-246
J. Math. Comput. Sci., 6 (2016), 230-234
J. Math. Comput. Sci., 6 (2016), 216-229
J. Math. Comput. Sci., 6 (2016), 203-215
J. Math. Comput. Sci., 6 (2016), 188-202
J. Math. Comput. Sci., 6 (2016), 173-187
J. Math. Comput. Sci., 6 (2016), 165-172
J. Math. Comput. Sci., 6 (2016), 156-164