The complexity of symmetrizing matrices

Research output: Contribution to journalArticle

3 Citations (Scopus)
Original languageEnglish (US)
Pages (from-to)108-109
Number of pages2
JournalInformation Processing Letters
Volume9
Issue number3
DOIs
StatePublished - Oct 5 1979
Externally publishedYes

Keywords

  • Graph isomorphism
  • isomorphism completeness
  • symmetrizable matrix

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

The complexity of symmetrizing matrices. / Colbourn, Charles.

In: Information Processing Letters, Vol. 9, No. 3, 05.10.1979, p. 108-109.

Research output: Contribution to journalArticle

@article{fc4fd4a2d300466fb3d265d8879cc321,
title = "The complexity of symmetrizing matrices",
keywords = "Graph isomorphism, isomorphism completeness, symmetrizable matrix",
author = "Charles Colbourn",
year = "1979",
month = "10",
day = "5",
doi = "10.1016/0020-0190(79)90048-6",
language = "English (US)",
volume = "9",
pages = "108--109",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - The complexity of symmetrizing matrices

AU - Colbourn, Charles

PY - 1979/10/5

Y1 - 1979/10/5

KW - Graph isomorphism

KW - isomorphism completeness

KW - symmetrizable matrix

UR - http://www.scopus.com/inward/record.url?scp=43549101872&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43549101872&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(79)90048-6

DO - 10.1016/0020-0190(79)90048-6

M3 - Article

VL - 9

SP - 108

EP - 109

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 3

ER -