Representative Sets of Product Families

DOI10.1007/978-3-662-44777-2_37zbMath1425.68448arXiv1402.3909OpenAlexW1944877748WikidataQ60488406 ScholiaQ60488406MaRDI QIDQ2921430

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

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3909

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 (21)

A randomized algorithm for long directed cycle ⋮ Spotting Trees with Few Leaves ⋮ Spotting Trees with Few Leaves ⋮ Deterministic Truncation of Linear Matroids ⋮ Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints ⋮ Mixing Color Coding-Related Techniques ⋮ Deterministic parameterized algorithms for the graph motif problem ⋮ Parameterized approximation algorithms for packing problems ⋮ Finding Two Edge-Disjoint Paths with Length Constraints ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Parameterized algorithms for graph partitioning problems ⋮ Parameterized complexity of superstring problems ⋮ Representative families: a unified tradeoff-based approach ⋮ Clifford algebras meet tree decompositions ⋮ Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs ⋮ Unnamed Item ⋮ Stable matching games: manipulation via subgraph isomorphism ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ Linear representation of transversal matroids and gammoids parameterized by rank ⋮ Long directed \((s,t)\)-path: FPT algorithm ⋮ On the complexity of algorithms for detecting \(k\)-length negative cost cycles

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