Recommendations
Cites work
- A decomposition theorem for partially ordered sets
- A Separator Theorem for Planar Graphs
- A trade-off between space and efficiency for routing tables
- An Optimal Synchronizer for the Hypercube
- Approximate distance oracles
- Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time
- Approximation algorithms for NP-hard problems.
- Automata, Languages and Programming
- Compact roundtrip routing in directed networks
- Compact routing with minimum stretch
- Computing almost shortest paths (extended abstract)
- Computing on a free tree via complexity-preserving mappings
- Concerning similarity transformations of linearly ordered sets
- Distributed Computing: A Locality-Sensitive Approach
- Efficient Provably-Secure Hierarchical Key Assignment Schemes
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Fast approximate PCPs for multidimensional bin-packing problems
- Finding sparser directed spanners
- Graph spanners
- scientific article; zbMATH DE number 1670859 (Why is no real title available?)
- scientific article; zbMATH DE number 5764799 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 512931 (Why is no real title available?)
- scientific article; zbMATH DE number 720183 (Why is no real title available?)
- scientific article; zbMATH DE number 2079397 (Why is no real title available?)
- scientific article; zbMATH DE number 2119746 (Why is no real title available?)
- scientific article; zbMATH DE number 1418269 (Why is no real title available?)
- Information theory in property testing and monotonicity testing in higher dimension
- Lower bounds for local monotonicity reconstruction from transitive-closure spanners
- Monotonicity testing over general poset domains
- Object location using path separators
- On sparse spanners of weighted graphs
- On the hardness of approximating spanners
- On the strength of comparisons in property testing
- Parallel Shortcutting of Rooted Trees
- Polylog-time and near-linear work approximation scheme for undirected shortest paths
- Property testing and its connection to learning and approximation
- Property-preserving data reconstruction
- Robust Characterizations of Polynomials with Applications to Program Testing
- Shortcutting Planar Digraphs
- Spot-checkers
- Steiner transitive-closure spanners of low-dimensional posets
- Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
- Testing monotonicity
- The Complexity of the Partial Order Dimension Problem
- The hardness of approximating spanner problems
- The Transitive Reduction of a Directed Graph
- Transitive-closure spanners
Cited in
(17)- Improved approximation for the directed spanner problem
- Steiner transitive-closure spanners of low-dimensional posets
- Dynamic tree shortcut with constant degree
- Steiner transitive-closure spanners of low-dimensional posets
- Transitive-closure spanners
- Transitive-closure spanners
- Shortcutting directed and undirected networks with a degree constraint
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
- Optimal unateness testers for real-valued functions: adaptivity helps
- Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases
- Limitations of local filters of Lipschitz and monotone functions
- Lower bounds for local monotonicity reconstruction from transitive-closure spanners
- Lower bounds for local monotonicity reconstruction from transitive-closure spanners
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms
- Roundtrip spanners with (2k-1) stretch
- Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces
- Giving some slack: shortcuts and transitive closure compressions
This page was built for publication: Transitive-closure spanners: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933368)
