Cartesian graph factorization at logarithmic cost per edge

F. Aurenhammer; J. Hagauer; W. Imrich

doi:10.1007/BF01200428

Cartesian graph factorization at logarithmic cost per edge

F. Aurenhammer, J. Hagauer, W. Imrich

Chair of Applied Mathematics (170)

Technische Universität Graz

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

44 Citations (Scopus)

Original language	English
Pages (from-to)	331-349
Number of pages	19
Journal	Computational complexity
Volume	2
Issue number	4
DOIs	https://doi.org/10.1007/BF01200428
Publication status	Published - Dec 1992

Keywords

Algorithms
Cartesian product graphs
Factorization
Subject classifications: 68Q05C

Access to Document

10.1007/BF01200428

Cite this

@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",

}

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

SN - 1016-3328

VL - 2

SP - 331

EP - 349

JO - Computational complexity

JF - Computational complexity

IS - 4

ER -

Cartesian graph factorization at logarithmic cost per edge

Keywords

Access to Document

Other files and links

Cite this