Computing Graph Distances Parameterized by Treewidth and Diameter
From MaRDI portal
Publication:4634399
DOI10.4230/LIPIcs.IPEC.2016.16zbMath1398.05076OpenAlexW2592637533MaRDI QIDQ4634399
Publication date: 10 April 2018
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/6947/
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Efficient parameterized algorithms for computing all-pairs shortest paths ⋮ Unnamed Item ⋮ Efficient and Adaptive Parameterized Algorithms on Modular Decompositions ⋮ Unnamed Item ⋮ Parameterized aspects of triangle enumeration ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Multivariate analysis of orthogonal range searching and graph distances ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time
This page was built for publication: Computing Graph Distances Parameterized by Treewidth and Diameter
