Article citationsMore>>

Alt, H., Blum, N., Mehlhborn, K. and Paul, M. (1991) Computing a Maximum Cardinality Matching in Bipartite Graphs in Time O(n^1.5√m log n) . Information Processing Letters, 37, 237-240.
http://dx.doi.org/10.1016/0020-0190(91)90195-N

has been cited by the following article:

• TITLE: Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time

  AUTHORS: Ruzayn Quaddoura

  KEYWORDS: Bipartite Graphs, Decomposition of Graphs, Design and Analysis of Algorithms, Matching

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.6 No.1, January 26, 2016

  ABSTRACT: The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.