The complexity of symmetrizing matrices

DOI10.1016/0020-0190(79)90048-6zbMATH Open0415.68007OpenAlexW2015658073MaRDI QIDQ600245FDOQ600245

Authors: Charles J. Colbourn 

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90048-6

zbMATH Keywords

symmetrizable matrixgraph isomorphism problemisomorphism completenessNp-completenesstransposable matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (3)

• A correction to Colbourn's paper on the complexity of matrix symmetrizability
• An algorithm for matrix symmetrization
• Graph isomorphism problem

This page was built for publication: The complexity of symmetrizing matrices

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