scientific article; zbMATH DE number 7561369
From MaRDI portal
Publication:5091005
DOI10.4230/LIPIcs.ISAAC.2018.15MaRDI QIDQ5091005
Rodrigo I. Silveira, Natalia Rodríguez, Delia Garijo, Alberto Márquez
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Euclidean chains and their shortcuts
- The continuous center set of a network
- Simplified linear-time Jordan sorting and polygon clipping
- Shortcut sets for the locus of plane Euclidean networks
- Minimizing the continuous diameter when augmenting a tree with a shortcut
- Plane Geometric Graph Augmentation: A Generic Perspective
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Recursive Star-Tree Parallel Data Structure
- The generalized diameter of a graph
- Lowest common ancestors in trees and directed acyclic graphs
This page was built for publication:
