The complexity of symmetrizing matrices

DOI10.1016/0020-0190(79)90048-6MaRDI QIDQ600245zbMATH OpenOpenAlexFDO

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

graph isomorphism problemisomorphism completenessNp-completenesssymmetrizable matrixtransposable 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)

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

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)