Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
DOI10.1137/1.9781611974782.92zbMATH Open1410.05201OpenAlexW2224152264MaRDI QIDQ4575835FDOQ4575835
Michał Pilipczuk, Saket Saurabh, Daniel Lokshtanov, Fedor V. Fomin, Marcin Wrochna
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.92
Recommendations
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- Bounded treewidth and space-efficient linear algebra
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Algebraic Graph Algorithms
- On the power of tree-depth for fully polynomial FPT algorithms
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cited In (10)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Solving systems of linear equations through zero forcing set
- Fast evaluation of interlace polynomials on graphs of bounded treewidth
- The Power of Linear-Time Data Reduction for Maximum Matching
- Title not available (Why is that?)
- The parameterised complexity of list problems on graphs of bounded treewidth
- A linear-time parameterized algorithm for computing the width of a DAG
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
- Revisiting Decomposition by Clique Separators
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
This page was built for publication: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575835)
