Finding and enumerating large intersections
Journal article, 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

Author

Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Theoretical Computer Science

0304-3975 (ISSN)

Vol. 580 75-82

Areas of Advance

Information and Communication Technology

Roots

Basic sciences

Subject Categories

Computer Science

Discrete Mathematics

DOI

10.1016/j.tcs.2015.02.034

More information

Created

10/7/2017