A correction to Colbourn's paper on the complexity of matrix symmetrizability

DOI10.1016/0020-0190(80)90012-5zbMath0455.68026OpenAlexW2031060694MaRDI QIDQ1150268

Charles J. Colbourn, Brendan D. McKay

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90012-5

zbMATH Keywords

NP-completenessgraph isomorphismsymmetrizable matrixtransposable matrixisomorphism complete

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

Polynomial recognition of cluster algebras of finite type, Graph isomorphism problem

Cites Work

• The complexity of symmetrizing matrices
• Some NP-Complete Problems Similar to Graph Isomorphism
• Unnamed Item