Linear algorithms for testing the sign stability of a matrix and for findingZ-maximum matchings in acyclic graphs
- 1 September 1977
- journal article
- research article
- Published by Springer Nature in Numerische Mathematik
- Vol. 28 (3), 273-285
- https://doi.org/10.1007/bf01389968
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- When is a Matrix Sign Stable?Canadian Journal of Mathematics, 1977
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- An O (N2.5) algorithm for maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Theorems on chemical network stabilityThe Journal of Chemical Physics, 1975
- Maximum Matching and the Rank of a MatrixSIAM Journal on Applied Mathematics, 1975
- Qualitative Stability and Digraphs in Model EcosystemsEcology, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- TWO THEOREMS IN GRAPH THEORYProceedings of the National Academy of Sciences, 1957