Cartesian graph factorization at logarithmic cost per edge

Franz Aurenhammer, Johann Hagauer, W. Imrich

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)331-349
JournalComputational complexity
Volume2
Issue number4
DOIs
Publication statusPublished - 1992

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

Cartesian graph factorization at logarithmic cost per edge. / Aurenhammer, Franz; Hagauer, Johann; Imrich, W.

In: Computational complexity, Vol. 2, No. 4, 1992, p. 331-349.

Research output: Contribution to journalArticleResearchpeer-review

Aurenhammer, Franz ; Hagauer, Johann ; Imrich, W. / Cartesian graph factorization at logarithmic cost per edge. In: Computational complexity. 1992 ; Vol. 2, No. 4. pp. 331-349.
@article{14101dda5a924b0db8494141b4a3db45,
title = "Cartesian graph factorization at logarithmic cost per edge",
author = "Franz Aurenhammer and Johann Hagauer and W. Imrich",
year = "1992",
doi = "10.1007/BF01200428",
language = "English",
volume = "2",
pages = "331--349",
journal = "Computational complexity",
issn = "1016-3328",
publisher = "Birkhauser Verlag Basel",
number = "4",

}

TY - JOUR

T1 - Cartesian graph factorization at logarithmic cost per edge

AU - Aurenhammer, Franz

AU - Hagauer, Johann

AU - Imrich, W.

PY - 1992

Y1 - 1992

U2 - 10.1007/BF01200428

DO - 10.1007/BF01200428

M3 - Article

VL - 2

SP - 331

EP - 349

JO - Computational complexity

JF - Computational complexity

SN - 1016-3328

IS - 4

ER -