Finding and enumerating large intersections
Saved in:
| Title: | Finding and enumerating large intersections |
|---|---|
| Authors: | Damaschke, Peter, 1963 |
| Source: | Theoretical Computer Science. 580:75-82 |
| Subject Terms: | intersection, disjoint sets, family of sets, parameterized algorithm, enumeration |
| Description: | 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. |
| File Description: | electronic |
| Access URL: | https://research.chalmers.se/publication/215359 http://dx.doi.org/10.1016/j.tcs.2015.02.034 |
| Database: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | 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. |
|---|---|
| ISSN: | 03043975 |
| DOI: | 10.1016/j.tcs.2015.02.034 |