Finding and enumerating large intersections

DOI10.1016/J.TCS.2015.02.034MaRDI QIDQ2344773zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 18 May 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.02.034

zbMATH Keywords

disjoint setsenumerationfamily of setsintersectionparameterized algorithm

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Combinatorial Pattern Matching
• An efficient method to evaluate intersections on big data sets
• An experimental investigation of set intersection algorithms for text searching
• Fast Intersection Algorithms for Sorted Sequences
• Fast set intersection and two-patterns matching

Cites work

• Consensus algorithms for the generation of all maximal bicliques
• Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
• Enumeration aspects of maximal cliques and bicliques
• On the generation of bicliques of a graph

Cited in

(2)

• An efficient method to evaluate intersections on big data sets
• Most-intersection of countable sets

This page was built for publication: Finding and enumerating large intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344773)