Factoring Cartesian-product graphs at logarithmic cost per edge

Franz Aurenhammer, [No Value] Hagauer J., [No Value] Imrich W.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationInteger programming and combinatorial optimization
PublisherUniv. of Waterloo Press
Pages29-44
ISBN (Print)0-88898-099-X
Publication statusPublished - 1990
EventConference on Integer Programming and Combinatorial Optimization - Waterloo, Canada
Duration: 28 May 199030 May 1990

Conference

ConferenceConference on Integer Programming and Combinatorial Optimization
CountryCanada
CityWaterloo
Period28/05/9030/05/90

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

Aurenhammer, F., Hagauer J., N. V., & Imrich W., N. V. (1990). Factoring Cartesian-product graphs at logarithmic cost per edge. In Integer programming and combinatorial optimization (pp. 29-44). Univ. of Waterloo Press.