The complexity of symmetrizing matrices

Charles J. Colbourn

doi:10.1016/0020-0190(79)90048-6

The complexity of symmetrizing matrices

Research output: Contribution to journal › Article › peer-review

Original language	English (US)
Pages (from-to)	108-109
Number of pages	2
Journal	Information Processing Letters
Volume	9
Issue number	3
DOIs	https://doi.org/10.1016/0020-0190(79)90048-6
State	Published - Oct 5 1979
Externally published	Yes

Keywords

Graph isomorphism
isomorphism completeness
symmetrizable matrix

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/0020-0190(79)90048-6

Cite this

@article{fc4fd4a2d300466fb3d265d8879cc321,

title = "The complexity of symmetrizing matrices",

keywords = "Graph isomorphism, isomorphism completeness, symmetrizable matrix",

author = "Colbourn, {Charles J.}",

year = "1979",

month = oct,

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 J.

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

AN - SCOPUS:43549101872

SN - 0020-0190

VL - 9

SP - 108

EP - 109

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

The complexity of symmetrizing matrices

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this