Theory of Output Set Assignments and Degree Switching Operations
From MaRDI portal
Publication:4113755
DOI10.1137/0205038zbMath0344.94022OpenAlexW2072342250MaRDI QIDQ4113755
Bharat Kinariwala, Kabekode V. S. Bhat
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205038
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Optimum and suboptimum methods for permuting a matrix into bordered triangular form ⋮ Degree switching operations in networks and large scale systems assignment problems ⋮ An algorithm for matrix symmetrization ⋮ Optimum tearing in large scale systems and minimum feedback cutsets of a digraph ⋮ An algorithm for then×n optimum assignment problem ⋮ The optimum assignments and a new heuristic approach for the traveling salesman problem
This page was built for publication: Theory of Output Set Assignments and Degree Switching Operations
