Faster Algebraic Algorithms for Path and Packing Problems
From MaRDI portal
Publication:3521948
DOI10.1007/978-3-540-70575-8_47zbMath1153.68562OpenAlexW1575411448WikidataQ56639268 ScholiaQ56639268MaRDI QIDQ3521948
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_47
Related Items (73)
A note on algebraic techniques for subgraph detection ⋮ Almost Optimal Cover-Free Families ⋮ Spotting Trees with Few Leaves ⋮ Fast exact algorithms using Hadamard product of polynomials ⋮ Spotting Trees with Few Leaves ⋮ An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs ⋮ Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints ⋮ Mixing Color Coding-Related Techniques ⋮ Randomized parameterized algorithms for the kidney exchange problem ⋮ Parameterized approximation algorithms for packing problems ⋮ Parameterized Complexity and Subexponential-Time Computability ⋮ Almost Induced Matching: Linear Kernels and Parameterized Algorithms ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Narrow sieves for parameterized paths and packings ⋮ Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem ⋮ A multivariate framework for weighted FPT algorithms ⋮ Space saving by dynamic algebraization based on tree-depth ⋮ Improved Parameterized Algorithms for Network Query Problems ⋮ On testing monomials in multivariate polynomials ⋮ Algebraic data retrieval algorithms for multi-channel wireless data broadcast ⋮ Improved parameterized algorithms for network query problems ⋮ Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms ⋮ Matching and weighted \(P_2\)-packing: algorithms and kernels ⋮ Number of cycles of small length in a graph ⋮ Detours in directed graphs ⋮ On the parameterized complexity of the repetition free longest common subsequence problem ⋮ Balanced substructures in bicolored graphs ⋮ Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials ⋮ An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem ⋮ Nearly exact mining of frequent trees in large networks ⋮ Faster algorithms for finding and counting subgraphs ⋮ Parameterized algorithms and kernels for almost induced matching ⋮ Constrained multilinear detection for faster functional motif discovery ⋮ Going Far from Degeneracy ⋮ Packing paths: recycling saves time ⋮ Detecting monomials with \(k\) distinct variables ⋮ The minimum feasible tileset problem ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ The Maximum Binary Tree Problem. ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials ⋮ Algorithms for topology-free and alignment network queries ⋮ Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs ⋮ Improved deterministic algorithms for weighted matching and packing problems ⋮ Algebraic methods in the congested clique ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding paths of length \(k\) in \(O^{*}(2^k)\) time ⋮ Partial information network queries ⋮ Faster deterministic parameterized algorithm for \(k\)-path ⋮ A Problem Kernelization for Graph Packing ⋮ Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem ⋮ Unnamed Item ⋮ An improved kernelization for \(P_{2}\)-packing ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ The maximum binary tree problem ⋮ Finding Detours is Fixed-Parameter Tractable ⋮ A Selection of Lower Bounds for Arithmetic Circuits ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space ⋮ Decomposition of Map Graphs with Applications. ⋮ An improved kernelization algorithm for \(r\)-set packing ⋮ Kernelization of Graph Hamiltonicity: Proper $H$-Graphs ⋮ Unnamed Item ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators ⋮ Shortest Two Disjoint Paths in Polynomial Time ⋮ Finding, hitting and packing cycles in subexponential time on unit disk graphs ⋮ Unnamed Item ⋮ Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth ⋮ Monomials in arithmetic circuits: complete problems in the counting hierarchy ⋮ TOWARD RANDOMIZED TESTING OF q-MONOMIALS IN MULTIVARIATE POLYNOMIALS ⋮ A fast parallel algorithm for minimum-cost small integral flows ⋮ Constrained multilinear detection and generalized graph motifs
This page was built for publication: Faster Algebraic Algorithms for Path and Packing Problems
