Theory of Output Set Assignments and Degree Switching Operations

DOI10.1137/0205038MaRDI QIDQ4113755zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(6)

• The optimum assignments and a new heuristic approach for the traveling salesman problem
• 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

This page was built for publication: Theory of Output Set Assignments and Degree Switching Operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4113755)