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

Charles J. Colbourn, Brendan D. McKay

Research output: Contribution to journalArticle

3 Scopus citations
Original languageEnglish (US)
Pages (from-to)96-97
Number of pages2
JournalInformation Processing Letters
Volume11
Issue number2
DOIs
StatePublished - Jan 1 1980
Externally publishedYes

Keywords

  • NP-complete
  • Symmetrizable matrix
  • computational complexity
  • isomorphism complete

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this