scientific article; zbMATH DE number 7525462
DOI10.4230/LIPIcs.ESA.2019.25zbMath1486.68246MaRDI QIDQ5075762
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
deterministic algorithmsexterior algebraalgebraic algorithmscolor-codingmultilinear detectioninternal out-branchingcolorful problemsextensor-coding
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Exterior algebra, Grassmann algebras (15A75) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- 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
- Minimum leaf out-branching and related problems
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- A linear vertex kernel for maximum internal spanning tree
- Sharp separation and applications to exact and parameterized algorithms
- Representative Sets of Product Families
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Mixing Color Coding-Related Techniques
- Faster Algebraic Algorithms for Path and Packing Problems
- Fourier meets M\"{o}bius: fast subset convolution
- Some Exact Complexity Results for Straight-Line Computations over Semirings
- Color-coding
- Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
- Clifford Algebras Meet Tree Decompositions
- LIMITS and Applications of Group Algebras for Parameterized Problems
- Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
- Extensor-coding
- Spotting Trees with Few Leaves
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
- Multiplying matrices faster than coppersmith-winograd
- Exact and Parameterized Algorithms for Max Internal Spanning Tree
This page was built for publication:
