Computational complexity, ‎1016-3328

Journal

ISSNs1016-3328
Additional searchable ISSN (electronic)1420-8954

Research output

  1. 1992
  2. Published

    Cartesian graph factorization at logarithmic cost per edge

    Aurenhammer, F., Hagauer, J. & Imrich, W., Dec 1992, In: Computational complexity. 2, 4, p. 331-349 19 p.

    Research output: Contribution to journalArticleResearchpeer-review