Pages that link to "Item:Q833703"
From MaRDI portal
The following pages link to Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703):
Displaying 14 items.
- Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- (Q5009466) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Continuous mean distance of a weighted graph (Q6045116) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Balancing graph Voronoi diagrams with one more vertex (Q6196878) (← links)
