Representative Families of Product Families

DOI10.1145/3039243zbMath1445.68330OpenAlexW2602820822WikidataQ60488357 ScholiaQ60488357MaRDI QIDQ4962667

Fahad Panolan, Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3039243

zbMATH Keywords

matroidsparameterized algorithmsrepresentative familiestree-width bounded graphsmulti-linear monomial detection

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (5)

Detours in directed graphs ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ Finding temporal paths under waiting time constraints ⋮ Finding Temporal Paths Under Waiting Time Constraints. ⋮ Representative families for matroid intersections, with applications to location, packing, and covering problems

This page was built for publication: Representative Families of Product Families