CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Finding and enumerating large intersections

Peter Damaschke (Institutionen för data- och informationsteknik, Datavetenskap, Algoritmer (Chalmers))
Theoretical Computer Science (0304-3975). Vol. 580 (2015), p. 75-82.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: intersection, disjoint sets, enumeration, family of sets, parameterized algorithm



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2015-04-20. Senast ändrad 2015-06-01.
CPL Pubid: 215359

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)