On the Power of Tree-Depth for Fully Polynomial FPT Algorithms

From MaRDI portal
Publication:3304140

DOI10.4230/LIPIcs.STACS.2018.41zbMath1487.68130arXiv1710.04376OpenAlexW2963360194MaRDI QIDQ3304140

Naoto Ohsaka, Tomoaki Ogasawara, Yoichi Iwata

Publication date: 5 August 2020

Full work available at URL: https://arxiv.org/abs/1710.04376




Related Items (12)



Cites Work


This page was built for publication: On the Power of Tree-Depth for Fully Polynomial FPT Algorithms