Cartesian graph factorization at logarithmic cost per edge

Research output: Contribution to journalArticleResearchpeer-review

Standard

Cartesian graph factorization at logarithmic cost per edge. / Aurenhammer, F.; Hagauer, J.; Imrich, W.
In: Computational complexity, Vol. 2, No. 4, 12.1992, p. 331-349.

Research output: Contribution to journalArticleResearchpeer-review

Vancouver

Aurenhammer F, Hagauer J, Imrich W. Cartesian graph factorization at logarithmic cost per edge. Computational complexity. 1992 Dec;2(4):331-349. doi: 10.1007/BF01200428

Author

Aurenhammer, F. ; Hagauer, J. ; Imrich, W. / Cartesian graph factorization at logarithmic cost per edge. In: Computational complexity. 1992 ; Vol. 2, No. 4. pp. 331-349.

Bibtex - Download

@article{52f95dec685640e088af15e7b18f3a2d,
title = "Cartesian graph factorization at logarithmic cost per edge",
keywords = "Algorithms, Cartesian product graphs, Factorization, Subject classifications: 68Q05C",
author = "F. Aurenhammer and J. Hagauer and W. Imrich",
year = "1992",
month = dec,
doi = "10.1007/BF01200428",
language = "English",
volume = "2",
pages = "331--349",
journal = "Computational complexity",
issn = "1016-3328",
publisher = "Birkhauser Verlag Basel",
number = "4",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - Cartesian graph factorization at logarithmic cost per edge

AU - Aurenhammer, F.

AU - Hagauer, J.

AU - Imrich, W.

PY - 1992/12

Y1 - 1992/12

KW - Algorithms

KW - Cartesian product graphs

KW - Factorization

KW - Subject classifications: 68Q05C

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

U2 - 10.1007/BF01200428

DO - 10.1007/BF01200428

M3 - Article

AN - SCOPUS:0011373247

VL - 2

SP - 331

EP - 349

JO - Computational complexity

JF - Computational complexity

SN - 1016-3328

IS - 4

ER -