Degree switching operations in networks and large scale systems assignment problems
From MaRDI portal
Publication:1139029
DOI10.1016/0016-0032(80)90028-9zbMath0432.94026OpenAlexW2072420850MaRDI QIDQ1139029
Publication date: 1980
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(80)90028-9
degree switching operationslisting all output sets for a large sparse square matrixoptimum assignment problemvertex disjoint cycles of specified lengths
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15) Large-scale systems (93A15)
Related Items
An algorithm for matrix symmetrization ⋮ The optimum assignments and a new heuristic approach for the traveling salesman problem
Cites Work
- The complexity of computing the permanent
- Optimum and suboptimum methods for permuting a matrix into bordered triangular form
- Optimum tearing in large scale systems and minimum feedback cutsets of a digraph
- A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
- A desirable form for sparse matrices when computing their inverse in factored forms
- An algorithm for then×n optimum assignment problem
- Matrix reduction—an efficient method
- Theory of Output Set Assignments and Degree Switching Operations
- On bordered triangular or lower N forms of an irreducible matrix
- A graph theoretical interpretation of nonsymmetric permutation on sparse matrices
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Complexity of Combinatorial Algorithms
- Some Matching Problems for Bipartite Graphs
- Partitioning and Tearing Systems of Equations
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Some Results on Sparse Matrices
- Depth-First Search and Linear Graph Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
