On Resilient Graph Spanners
نویسندگان
چکیده
منابع مشابه
Dynamic Algorithms for Graph Spanners
Let G = (V, E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. For the graph G, A spanner with stretch t ∈ N is a subgraph (V, ES), ES ⊆ E, such that the distance between any pair of vertices in this subgraph is at most t times the distance between them in the graph G. We present simple and efficient dynamic algorithms for maintaining spanners with essentially optimal (e...
متن کاملKharita: Robust Map Inference using Graph Spanners
ewidespread availability of GPS information in everyday devices such as cars, smartphones and smart watches make it possible to collect large amount of geospatial trajectory information. A particularly important, yet technically challenging, application of this data is to identify the underlying road network and keep it updated under various changes. In this paper, we propose ecient algorithm...
متن کاملFaster Streaming algorithms for graph spanners
Given an undirected graph G = (V,E) on n vertices, m edges, and an integer t ≥ 1, a subgraph (V,ES), ES ⊆ E is called a t-spanner if for any pair of vertices u, v ∈ V , the distance between them in the subgraph is at most t times the actual distance. We present streaming algorithms for computing a t-spanner of essentially optimal size-stretch trade offs for any undirected graph. Our first algor...
متن کاملOn Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...
متن کاملOn Generalized Diamond Spanners
Given a set P of points in the plane and a set L of non-crossing line segments whose endpoints are in P , a constrained plane geometric graph is a plane graph whose vertex set is P and whose edge set contains L. An edge e has the α-visible diamond property if one of the two isosceles triangles with base e and base angle α does not contain any points of P visible to both endpoints of e. A constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0006-x