Quasipolynomial representation of transversal matroids with applications in parameterized complexity
From MaRDI portal
Publication:4993296
Recommendations
- A fast algorithm to construct a representation for transversal matroids
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Linear representation of transversal matroids and gammoids parameterized by rank
- Linear representation of transversal matroids and gammoids parameterized by rank
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- A parameterized view on matroid optimization problems
- A probabilistic remark on algebraic program testing
- Algorithms for topology-free and alignment network queries
- Bipartite perfect matching in pseudo-deterministic NC
- Bipartite perfect matching is in quasi-NC
- Constrained multilinear detection and generalized graph motifs
- Constrained multilinear detection for faster functional motif discovery
- Deterministic algorithms for matching and packing problems based on representative sets
- Deterministic parameterized algorithms for the graph motif problem
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Finding and counting vertex-colored subtrees
- Linear matroid intersection is in quasi-NC
- Linear representation of transversal matroids and gammoids parameterized by rank
- Matching is as easy as matrix inversion
- Parameterized Algorithms for List K-Cycle
- Powers of tensors and fast matrix multiplication
- Subexponential algorithms for rectilinear Steiner tree and arborescence problems
Cited in
(8)- Vandermonde matrices, NP-completeness and transversal subspaces
- Linear representation of transversal matroids and gammoids parameterized by rank
- Finding temporal paths under waiting time constraints
- The templates for some classes of quaternary matroids
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- A fast algorithm to construct a representation for transversal matroids
- Linear representation of transversal matroids and gammoids parameterized by rank
This page was built for publication: Quasipolynomial representation of transversal matroids with applications in parameterized complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993296)
