Two Algorithms for Bipartite Graphs
- 1 March 1963
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Journal of the Society for Industrial and Applied Mathematics
- Vol. 11 (1) , 183-194
- https://doi.org/10.1137/0111014
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Connectivity and Reducibility of GraphsCanadian Journal of Mathematics, 1962
- An algorithm for a minimum cover of a graphProceedings of the American Mathematical Society, 1959
- The Term and Stochastic Ranks of a MatrixCanadian Journal of Mathematics, 1959
- The Term Rank of a MatrixCanadian Journal of Mathematics, 1958
- Coverings of Bipartite GraphsCanadian Journal of Mathematics, 1958
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- An Algorithm for Distinct RepresentativesThe American Mathematical Monthly, 1956