Two Algorithms for Bipartite Graphs
A. L. Dulmage, N. S. Mendelsohn · Journal of the Society for Industrial and Applied Mathematics · 1963
Previous article Next article Two Algorithms for Bipartite GraphsA. L. Dulmage and N. S. MendelsohnA. L. Dulmage and N. S. Mendelsohnhttps://doi.org/10.1137/0111014PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] A. L. Dulmage and , N. S. Mendelsohn, Coverings of bipartite graphs, Canad. J. Math., 10 (1958), 517–534 MR0097069 0091.37404 CrossrefGoogle Scholar[2] A. L. Dulmage and , N. S. Mendelsohn, A structure theory of bipartite graphs of finite exterior dimension, Trans. Roy. Soc. Canada. Sect. III, 53 (1959), 1–13 Google Scholar[3] A. L. Dulmage and , N. S. Mendelsohn, The term and stochastic ranks of a matrix, Canad. J. Math., 11 (1959), 269–279 MR0104680 0086.01802 CrossrefGoogle Scholar[4] Diane M. Johnson, , A. L. Dulmage and , N. S. Mendelsohn, Connectivity and reducibility of graphs, Canad. J. Math., 14 (1962), 529–539 MR0140436 0105.35502 CrossrefISIGoogle Scholar[5] L. R. Ford, Jr. and , D. R. Fulkerson, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem, Canad. J. Math., 9 (1957), 210–218 MR0093427 0088.12907 CrossrefGoogle Scholar[6] Marshall Hall, An algorithm for distinct representatives, Amer. Math. Monthly, 63 (1956), 716–717 MR0084476 0074.25004 CrossrefGoogle Scholar[7] Dénes König, Theorie der endlichen und unendlichen Graphen. Kombinatorische Topologie der Streckenkomplexe, Chelsea Publishing Co., New York, N. Y., 1950ix+258 MR0036989 Google Scholar[8] Robert Z. Norman and , Michael O. Rabin, An algorithm for a minimum cover of a graph, Proc. Amer. Math. Soc., 10 (1959), 315–319 MR0106853 0093.37702 CrossrefGoogle Scholar[9] H. J. Ryser, The term rank of a matrix, Canad. J. Math., 10 (1958), 57–65 MR0092752 0079.01103 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails On the Block Triangular Form of Symmetric MatricesIain S. Duff and Bora Uçar5 August 2010 | SIAM Review, Vol. 52, No. 3AbstractPDF (411 KB)Combinatorial Analysis of Singular Matrix PencilsSatoru Iwata and Ryo Shimizu26 January 2007 | SIAM Journal on Matrix Analysis and Applications, Vol. 29, No. 1AbstractPDF (187 KB)Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear EquationsKazuo Murota, Masao Iri, and Masataka Nakamura17 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 8, No. 1AbstractPDF (2784 KB)Theory of Output Set Assignments and Degree Switching OperationsBharat Kinariwala and Kabekode V. S. Bhat13 July 2006 | SIAM Journal on Computing, Vol. 5, No. 4AbstractPDF (1422 KB)Remarks on Solutions of the Optimal Assignment ProblemA. L. Dulmage and N. S. Mendelsohn13 July 2006 | Journal of the Society for Industrial and Applied Mathematics, Vol. 11, No. 4AbstractPDF (676 KB) Volume 11, Issue 1| 1963Journal of the Society for Industrial and Applied Mathematics History Submitted:06 June 1961Published online:13 July 2006 InformationCopyright © 1963 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0111014Article page range:pp. 183-194ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics