A graph theoretical interpretation of nonsymmetric permutation on sparse matrices
From MaRDI portal
Publication:4132146
DOI10.1002/cta.4490050206zbMath0359.94049OpenAlexW2002136992MaRDI QIDQ4132146
Alberto L. Sangiovanni-Vincentelli
Publication date: 1977
Published in: International Journal of Circuit Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cta.4490050206
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Degree switching operations in networks and large scale systems assignment problems ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I ⋮ A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
Cites Work
This page was built for publication: A graph theoretical interpretation of nonsymmetric permutation on sparse matrices
