Finding and enumerating large intersections
Artikel i vetenskaplig tidskrift, 2015

We study the calculation of the largest pairwise intersections in a given set family. We give combinatorial and algorithmic results both for the worst case and for set families where the frequencies of elements follow a power law, as words in texts typically do. The results can be used in faster preprocessing routines in a simple approach to multi-document summarization.

parameterized algorithm

disjoint sets

enumeration

family of sets

intersection

Författare

Peter Damaschke

Chalmers, Data- och informationsteknik, Datavetenskap

Theoretical Computer Science

0304-3975 (ISSN)

Vol. 580 75-82

Styrkeområden

Informations- och kommunikationsteknik

Fundament

Grundläggande vetenskaper

Ämneskategorier

Datavetenskap (datalogi)

Diskret matematik

DOI

10.1016/j.tcs.2015.02.034

Mer information

Skapat

2017-10-07