An Optimal Synchronizer for the Hypercube
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On 2-detour subgraphs of the hypercube
- Edge-disjoint spanners in tori
- On sparse spanners of weighted graphs
- Edge-disjoint spanners of complete graphs and complete digraphs
- Tentative and definite distributed computations: An optimistic approach to network synchronization
- Methods and problems of communication in usual networks
- The use of a synchronizer yields the maximum computation rate in distributed networks
- Restrictions of minimum spanner problems
- Spanners and message distribution in networks.
- An extremal problem in the hypercube and optimization of asynchronous circuits
- Sparse hypercube 3-spanners
- Local majorities, coalitions and monopolies in graphs: A review
- Tree spanners of bounded degree graphs
- New pairwise spanners
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- The non-approximability of bicriteria network design problems
- Balancing minimum spanning trees and shortest-path trees
- Isomorphic tree spanner problems
- Degree-constrained spanners for multidimensional grids
- Spanners of bounded degree graphs
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Graph spanners: a tutorial review
- The minimum stretch spanning tree problem for typical graphs
- Edge tree spanners
- Light spanners for high dimensional norms via stochastic decompositions
- Lasserre integrality gaps for graph spanners and related problems
- Minimum \(t\)-spanners on subcubic graphs
- Parameterized complexity of directed spanner problems
- Demand-aware network designs of bounded degree
- The sparsest additive spanner via multiple weighted BFS trees
- A parallel bio-inspired shortest path algorithm
- Hardness and efficiency on \(t\)-admissibility for graph operations
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Message lower bounds via efficient network synchronization
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Tree-decompositions with bags of small diameter
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Spanners for bounded tree-length graphs
- Can we locally compute sparse connected subgraphs?
- Distributed distance computation and routing with small messages
- Max-stretch reduction for tree spanners
- Edge-disjoint spanners in Cartesian products of graphs
- Self-spanner graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Optimality computation of the minimum stretch spanning tree problem
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- On approximating tree spanners that are breadth first search trees
- Message Lower Bounds via Efficient Network Synchronization
- Spanners of de Bruijn and Kautz graphs
- Chasing a fast robber on planar graphs and random graphs
- Rumor spreading with no dependence on conductance
- Improved approximation for the directed spanner problem
- Minimax flow tree problems
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- Simple distributed spanners in dense congest networks
- Additive tree 2-spanners of permutation graphs
- Small stretch pairwise spanners and approximate D-preservers
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- scientific article; zbMATH DE number 4085000 (Why is no real title available?)
- Sparse reliable graph backbones
- On the memory overhead of distributed snapshots
- Synchronizing hypercube networks in the presence of faults
- Collective additive tree spanners for circle graphs and polygonal graphs
- Multipath spanners via fault-tolerant spanners
- Transitive-closure spanners: a survey
- The greedy spanner is existentially optimal
- Local algorithms for bounded degree sparsifiers in sparse graphs
- Distributed spanner approximation
- Light spanners for high dimensional norms via stochastic decompositions
- Euclidean Steiner spanners: light and sparse
- Generating sparse spanners for weighted graphs
- Generating sparse 2—spanners
- Local computation algorithms for spanners
- Congested clique algorithms for graph spanners
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees
- The norms of graph spanners
- Bypassing Erdős' girth conjecture: hybrid stretch and sourcewise spanners
- Refined vertex sparsifiers of planar graphs
- Graph Transformations
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Approximating \(k\)-spanner problems for \(k>2\)
- A simple and efficient kinetic spanner
- Tree spanners in planar graphs
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
- General variable neighborhood search for the minimum stretch spanning tree problem
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Parameterized Complexity of Directed Spanner Problems.
- Tree 3-spanners on generalized prisms of graphs
- Online Spanners in Metric Spaces
- Approximation of minimum weight spanners for sparse graphs
- A unified framework for light spanners
- Spanners in sparse graphs
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- Polynomial algorithms for sparse spanners on subcubic graphs
- Distributed computing in the asynchronous LOCAL model
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- Color fault-tolerant spanners
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)
