A Representation of bipartite graphs by digraphs and its programming application

References

• Dulmage , A.L. and Mendelsohn , N.S. 1963 . Two algorithms for bipartite graphs . SIAM J. Appl. Math , 1 : 183 – 194 .
   Google Scholar
• Golumbic , M.C. and Goss , C.F. 1978 . Perfect elimination and Chordal bipartite graphs . J. Graph Theory , 2 : 155 – 163 .
   Google Scholar
• Harary , F. , Norman , R.Z. and Cartwright , D. 1965 . Structural Models: An Introduction to the Theory of Directed Graphs , New York : Wiley .
   Google Scholar
• Hopcroft , J.E. and Karp , R.M. 1973 . Ann5 : 2 algorithm for maximum matching in bipartite graphs . SIAM J. Comput , 2 : 225 – 231 .
   Google Scholar
• Itai , A. , Rodeh , M. and Tamimoto , S.L. 1978 . Some matching problems for bipartite graphs . JACM , 25 : 517 – 525 .
   Google Scholar
• Sangiovanni-Vincentilli , A. 1976 . A note in bipartite graphs and pivot selection in sparse matrices . IEEE Trans , 23 : 817 – 821 .
   Google Scholar