Randomized divide-and-conquer: improved path, matching, and packing algorithms
From MaRDI portal
Recommendations
- Improved algorithms for path, matching, and packing problems
- Randomized parameterized algorithms for P₂-packing and co-path packing problems
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- Random methods for parameterized problems
- Narrow sieves for parameterized paths and packings
Cited in
(45)- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Improvised divide and conquer approach for the LIS problem
- Long directed \((s,t)\)-path: FPT algorithm
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
- Partial information network queries
- Parameterized complexity of \textsc{maximum edge colorable subgraph}
- Parameterized complexity of maximum edge colorable subgraph
- Faster deterministic parameterized algorithm for k-path
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- The parameterized complexity of unique coverage and its variants
- Narrow sieves for parameterized paths and packings
- Improved parameterized algorithms for network query problems
- Digraph width measures in parameterized algorithmics
- Edge-disjoint packing of stars and cycles
- Parameterized algorithms for edge biclique and related problems
- QUBO formulations of the longest path problem
- Assigning channels via the meet-in-the-middle approach
- Parameterized complexity and subexponential-time computability
- Improved algorithms for path, matching, and packing problems
- Improved parameterized algorithms for network query problems
- Parameterized and approximation algorithms for finding two disjoint matchings
- Parameterized approximation algorithms for packing problems
- Deterministic algorithms for matching and packing problems based on representative sets
- Spotting trees with few leaves
- Mixing Color Coding-Related Techniques
- Edge-disjoint packing of stars and cycles
- Divide-and-Color
- On digraph width measures in parameterized algorithmics
- Random methods for parameterized problems
- Finding detours is fixed-parameter tractable
- Going far from degeneracy
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- Going far from degeneracy
- Improved deterministic algorithms for weighted matching and packing problems
- Spotting trees with few leaves
- The \(k\)-distinct language: parameterized automata constructions
- Detours in directed graphs
- Parameterized Counting and Cayley Graph Expanders
- Parameterized algorithms for list \(K\)-cycle
- Parameterized algorithms for the spanning forest isomorphism and containment on tree
- Determinantal sieving
- Forgetfulness can make you faster: an O^*(8.097ᵏ)-time algorithm for weighted 3-set k-packing
- Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
- Detecting and counting small subgraphs, and evaluating a parameterized Tutte polynomial: lower bounds via toroidal grids and Cayley graph expanders
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
This page was built for publication: Randomized divide-and-conquer: improved path, matching, and packing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3654388)
