Faster Algebraic Algorithms for Path and Packing Problems
From MaRDI portal
Recommendations
Cited in
(93)- Clearing directed subgraphs by mobile agents. Variations on covering with paths
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Partial information network queries
- The maximum binary tree problem
- Univariate ideal membership parameterized by rank, degree, and number of generators
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- A note on algebraic techniques for subgraph detection
- Parameterized algorithms and kernels for almost induced matching
- Algorithms for topology-free and alignment network queries
- Faster deterministic parameterized algorithm for k-path
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- A fast parallel algorithm for minimum-cost small integral flows
- Narrow sieves for parameterized paths and packings
- A multivariate framework for weighted FPT algorithms
- Space saving by dynamic algebraization based on tree-depth
- Improved parameterized algorithms for network query problems
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
- Nearly exact mining of frequent trees in large networks
- Packing paths: recycling saves time
- Constrained multilinear detection and generalized graph motifs
- Randomized parameterized algorithms for the kidney exchange problem
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms
- A Selection of Lower Bounds for Arithmetic Circuits
- Toward randomized testing of q-monomials in multivariate polynomials
- Parameterized complexity and subexponential-time computability
- Fast witness extraction using a decision oracle
- Improved parameterized algorithms for network query problems
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- Parameterized approximation algorithms for packing problems
- Almost induced matching: linear kernels and parameterized algorithms
- Deterministic algorithms for matching and packing problems based on representative sets
- Spotting trees with few leaves
- Fast algorithms for parameterized problems with relaxed disjointness constraints
- Mixing Color Coding-Related Techniques
- A Problem Kernelization for Graph Packing
- On testing monomials in multivariate polynomials
- Algebraic data retrieval algorithms for multi-channel wireless data broadcast
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- On the parameterized complexity of the repetition free longest common subsequence problem
- Faster algorithms for finding and counting subgraphs
- A family of efficient regular arrays for algebraic path problem
- Constrained multilinear detection for faster functional motif discovery
- Detecting monomials with k distinct variables
- LIMITS and applications of group algebras for parameterized problems
- Finding detours is fixed-parameter tractable
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs
- r -Simple k -Path and Related Problems Parameterized by k / r
- Patching colors with tensors
- Going far from degeneracy
- Univariate ideal membership parameterized by rank, degree, and number of generators
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- Decomposition of Map Graphs with Applications.
- Going far from degeneracy
- Engineering motif search for large motifs
- Extensor-coding
- On \(r\)-simple \(k\)-path and related problems parameterized by \(k/r\)
- Shortest two disjoint paths in polynomial time
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
- Almost optimal cover-free families
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
- Improved deterministic algorithms for weighted matching and packing problems
- Spotting trees with few leaves
- More applications of the polynomial method to algorithm design
- scientific article; zbMATH DE number 7053391 (Why is no real title available?)
- The Maximum Binary Tree Problem.
- 1.61-approximation for min-power strong connectivity with two power levels
- The \(k\)-distinct language: parameterized automata constructions
- Number of cycles of small length in a graph
- Detours in directed graphs
- Balanced substructures in bicolored graphs
- Long directed detours: reduction to 2-disjoint paths
- Approximating long cycle above Dirac's guarantee
- Parameterized algorithms for list \(K\)-cycle
- Computing paths of large rank in planar frameworks deterministically
- Balanced substructures in bicolored graphs
- Finding and counting patterns in sparse graphs
- Two-sets cut-uncut on planar graphs
- Determinantal sieving
- Computing paths of large rank in planar frameworks deterministically
- Forgetfulness can make you faster: an O^*(8.097ᵏ)-time algorithm for weighted 3-set k-packing
- Fixed-parameter tractability of maximum colored path and beyond
- A simple inclusion-exclusion based algorithm for (k, n)-MLC and related problems
- On approximate symmetric polynomials and tightness of homogenization results
- Methods for finding paths of a prescribed length in weighted graphs
- Decomposition of map graphs with applications
- An improved kernelization algorithm for \(r\)-set packing
- Fast exact algorithms using Hadamard product of polynomials
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
- An improved kernelization for \(P_{2}\)-packing
This page was built for publication: Faster Algebraic Algorithms for Path and Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521948)
