An Optimal Synchronizer for the Hypercube
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Improved approximation for the directed spanner problem
- The greedy spanner is existentially optimal
- An extremal problem in the hypercube and optimization of asynchronous circuits
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- Small stretch pairwise spanners and approximate D-preservers
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Bypassing Erdős' girth conjecture: hybrid stretch and sourcewise spanners
- Balancing minimum spanning trees and shortest-path trees
- Edge-disjoint spanners in Cartesian products of graphs
- Spanners and message distribution in networks.
- Light spanners for high dimensional norms via stochastic decompositions
- Refined vertex sparsifiers of planar graphs
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- An approximation algorithm for the edge-dilation \(k\)-center problem.
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- The use of a synchronizer yields the maximum computation rate in distributed networks
- Tree-decompositions with bags of small diameter
- Demand-aware network designs of bounded degree
- Graph spanners: a tutorial review
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- Fast deterministic distributed algorithms for sparse spanners
- Generating sparse 2—spanners
- Edge-disjoint spanners in tori
- Multipath spanners via fault-tolerant spanners
- Online spanners in metric spaces
- Minimizing distances between vertices and edges through tree t-spanners
- On approximating tree spanners that are breadth first search trees
- Small stretch ( , )-spanners in the streaming model
- Euclidean Steiner spanners: light and sparse
- An alternate proof of near-optimal light spanners
- \(f\)-sensitivity distance oracles and routing schemes
- Spanners in sparse graphs
- Sparse reliable graph backbones
- Generating sparse spanners for weighted graphs
- Lasserre integrality gaps for graph spanners and related problems
- A parallel bio-inspired shortest path algorithm
- Collective tree spanners in graphs with bounded parameters
- General variable neighborhood search for the minimum stretch spanning tree problem
- The minimum stretch spanning tree problem for typical graphs
- Tree 3-spanners on generalized prisms of graphs
- Congested clique algorithms for graph spanners
- Hardness and efficiency on \(t\)-admissibility for graph operations
- Parameterized Complexity of Directed Spanner Problems.
- Message lower bounds via efficient network synchronization
- Spanners of de Bruijn and Kautz graphs
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- The non-approximability of bicriteria network design problems
- Tree spanners in planar graphs
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Rumor spreading with no dependence on conductance
- scientific article; zbMATH DE number 4085000 (Why is no real title available?)
- Approximation algorithms for directed weighted spanners
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Distributed spanner approximation
- Tentative and definite distributed computations: An optimistic approach to network synchronization
- Local majorities, coalitions and monopolies in graphs: A review
- Distributed distance computation and routing with small messages
- Transitive-closure spanners: a survey
- Combinatorial network abstraction by trees and distances
- Collective additive tree spanners for circle graphs and polygonal graphs
- Minimizing distances between vertices and edges through tree \(t\)-spanners
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Message Lower Bounds via Efficient Network Synchronization
- A simple and efficient kinetic spanner
- Graph spanners in the streaming model: An experimental study
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Tree spanners of bounded degree graphs
- Simple distributed spanners in dense congest networks
- Optimality computation of the minimum stretch spanning tree problem
- Max-stretch reduction for tree spanners
- The sparsest additive spanner via multiple weighted BFS trees
- On sparse spanners of weighted graphs
- On euclidean Steiner (1+)-spanners
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Light Euclidean Steiner spanners in the plane
- Spanners of bounded degree graphs
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- Minimum \(t\)-spanners on subcubic graphs
- Parameterized complexity of directed spanner problems
- scientific article; zbMATH DE number 7378699 (Why is no real title available?)
- Constant-round spanners and shortest paths in congested clique and MPC
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees
- Isomorphic tree spanner problems
- Methods and problems of communication in usual networks
- Polynomial algorithms for sparse spanners on subcubic graphs
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- scientific article; zbMATH DE number 7561533 (Why is no real title available?)
- Approximating \(k\)-spanner problems for \(k>2\)
- On the memory overhead of distributed snapshots
- Online Spanners in Metric Spaces
- Restrictions of minimum spanner problems
- Approximation of minimum weight spanners for sparse graphs
- Edge-disjoint spanners of complete graphs and complete digraphs
- Spanners for bounded tree-length graphs
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
- Edge tree spanners
- Chasing a fast robber on planar graphs and random graphs
- Minimax flow tree problems
- Graph Transformations
This page was built for publication: An Optimal Synchronizer for the Hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4730798)
