A correction to Colbourn's paper on the complexity of matrix symmetrizability
type: Item
instance of: scholarly article
title: A correction to Colbourn's paper on the complexity of matrix symmetrizability
zbMATH Open document ID: 0455.68026
DOI: 10.1016/0020-0190(80)90012-5
author: Charles J. Colbourn
author: Brendan D. McKay
published in: Information Processing Letters
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 3713179
zbMATH Keywords: graph isomorphism
zbMATH Keywords: symmetrizable matrix
zbMATH Keywords: transposable matrix
zbMATH Keywords: isomorphism complete
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: 0020-0190(80)90012-5
OpenAlex ID: W2031060694
cites work: The complexity of symmetrizing matrices
cites work: Some NP-Complete Problems Similar to Graph Isomorphism
cites work: Q3877692
description: scientific article; zbMATH DE number 3713179