Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
From MaRDI portal
Publication:4575835
DOI10.1137/1.9781611974782.92zbMath1410.05201OpenAlexW2224152264MaRDI QIDQ4575835
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
Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs ⋮ On the Power of Tree-Depth for Fully Polynomial FPT Algorithms ⋮ A linear-time parameterized algorithm for computing the width of a DAG ⋮ Revisiting Decomposition by Clique Separators ⋮ Efficient and Adaptive Parameterized Algorithms on Modular Decompositions ⋮ Unnamed Item ⋮ The Power of Linear-Time Data Reduction for Maximum Matching
This page was built for publication: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
