An algorithm for matrix symmetrization
From MaRDI portal
Publication:1166891
DOI10.1016/0016-0032(81)90074-0zbMath0489.65029OpenAlexW1974448542MaRDI QIDQ1166891
Publication date: 1981
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(81)90074-0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- The complexity of symmetrizing matrices
- Degree switching operations in networks and large scale systems assignment problems
- On the computational power of pushdown automata
- Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing
- Theory of Output Set Assignments and Degree Switching Operations
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: An algorithm for matrix symmetrization
