Algorithms for graphs of bounded treewidth via orthogonal range searching-Reference-Cited by-同舟云学术

Algorithms for graphs of bounded treewidth via orthogonal range searching

Published:2009-11 Issue:9 Volume:42 Page:815-824
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Cabello Sergio,Knauer Christian

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference28 articles.

1. Geometric range searching and its relatives;Agarwal,1998

2. Computing the detour and spanning ratio of paths, trees, and cycles in 2d and 3d;Agarwal;Discrete Comput. Geom.,2008

3. P.K. Agarwal, R. Klein, C. Knauer, M. Sharir, Computing the detour of polygonal curves, Technical Report B 02-03, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2002

4. On approximating the average distance between points;Barhum,2007

5. Efficient algorithms for the weighted 2-center problem in a cactus graph;Ben-Moshe,2005

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Balancing graph Voronoi diagrams with one more vertex;Networks;2023-11-21

2. Continuous Mean Distance of a Weighted Graph;Results in Mathematics;2023-04-29

3. Distance problems within Helly graphs and k-Helly graphs;Theoretical Computer Science;2023-02

4. Puterea modelelor de interval în problema calculării indicilor de centralitate;Revista Română de Informatică și Automatică;2022-12-20

5. Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension;SIAM Journal on Computing;2022-10-28