scientific article; zbMATH DE number 1830717

MaRDI QIDQ4778538zbMATH OpenFDO

Authors Ferran Hurtado, Giuseppe Liotta, Henk Meijer

Publication date 18 November 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2125/21250002

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Optimal and suboptimal robust algorithms for proximity graphs
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
• A low arithmetic-degree algorithm for computing proximity graphs
• Output-sensitive algorithm for computing -skeletons
• Fast algorithms for computing -skeletons and their relatives.

Cited in

(11)

• Time-optimal proximity graph computations on enhanced meshes
• Optimal approximation algorithms for maximum distance-bounded subgraph problems
• Optimal and suboptimal robust algorithms for proximity graphs
• scientific article; zbMATH DE number 2086250 (Why is no real title available?)
• On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
• Algorithms for computing the optimal transitive approximation of a proximity relation
• A low arithmetic-degree algorithm for computing proximity graphs
• Proximity Search for Maximal Subgraph Enumeration
• New measures of proximity for the assignment algorithms in the MDVRPTW
• Essential constraints of edge-constrained proximity graphs
• Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778538)