The complexity of symmetrizing matrices
type: Item
instance of: scholarly article
title: The complexity of symmetrizing matrices
zbMATH Open document ID: 0415.68007
DOI: 10.1016/0020-0190(79)90048-6
author: Charles J. Colbourn
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 3646277
zbMATH Keywords: graph isomorphism problem
zbMATH Keywords: symmetrizable matrix
zbMATH Keywords: transposable matrix
zbMATH Keywords: isomorphism completeness
zbMATH Keywords: Np-completeness
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90048-6
OpenAlex ID: W2015658073
description: scientific article; zbMATH DE number 3646277