Covering and packing in linear space

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Abstract

Here, we introduce a new, fast zeta transform algorithm that improves the space requirement to only linear in the size of the given set family, while not increasing the time requirement
Original languageEnglish
JournalInformation Processing Letters
Volume111
Issue number21-22
Pages (from-to)1033
Number of pages3
ISSN0020-0190
DOIs
Publication statusPublished - 2011

Keywords

  • Algorithms
  • Chromatic polynomial
  • Zeta transform

Fingerprint

Dive into the research topics of 'Covering and packing in linear space'. Together they form a unique fingerprint.

Cite this