Parameterized complexity of diameter
From MaRDI portal
Publication:5919396
DOI10.1007/978-3-030-17402-6_5OpenAlexW2962831827MaRDI QIDQ5919396
André Nichterlein, Matthias Bentert
Publication date: 6 February 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.10048
Related Items (3)
Unnamed Item ⋮ A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph ⋮ Multivariate analysis of orthogonal range searching and graph distances
This page was built for publication: Parameterized complexity of diameter
