The complexity of symmetrizing matrices

DOI10.1016/0020-0190(79)90048-6zbMath0415.68007OpenAlexW2015658073MaRDI QIDQ600245

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

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

Related Items (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