Pages that link to "Item:Q4730798"

The following pages link to An Optimal Synchronizer for the Hypercube (Q4730798):

Displaying 50 items.

• On approximating tree spanners that are breadth first search trees (Q269500) (← links)
• Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
• Sparse reliable graph backbones (Q418121) (← links)
• Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
• Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
• Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
• Spanners in sparse graphs (Q657919) (← links)
• Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
• \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
• An approximation algorithm for the edge-dilation \(k\)-center problem. (Q703267) (← links)
• Graph spanners in the streaming model: An experimental study (Q834593) (← links)
• Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
• Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
• A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
• Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
• Combinatorial network abstraction by trees and distances (Q954979) (← links)
• On 2-detour subgraphs of the hypercube (Q1014814) (← links)
• Edge-disjoint spanners in tori (Q1025482) (← links)
• On sparse spanners of weighted graphs (Q1196368) (← links)
• Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
• Tentative and definite distributed computations: An optimistic approach to network synchronization (Q1330420) (← links)
• Methods and problems of communication in usual networks (Q1339884) (← links)
• The use of a synchronizer yields the maximum computation rate in distributed networks (Q1364128) (← links)
• Restrictions of minimum spanner problems (Q1370655) (← links)
• Spanners and message distribution in networks. (Q1427197) (← links)
• Sparse hypercube 3-spanners (Q1570842) (← links)
• Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
• Tree spanners of bounded degree graphs (Q1693164) (← links)
• New pairwise spanners (Q1693988) (← links)
• NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
• The non-approximability of bicriteria network design problems (Q1827279) (← links)
• Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
• Isomorphic tree spanner problems (Q1899446) (← links)
• Degree-constrained spanners for multidimensional grids (Q1917351) (← links)
• Spanners of bounded degree graphs (Q1944059) (← links)
• Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
• Graph spanners: a tutorial review (Q2026289) (← links)
• The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
• Edge tree spanners (Q2056906) (← links)
• Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
• Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
• Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
• Parameterized complexity of directed spanner problems (Q2161008) (← links)
• Demand-aware network designs of bounded degree (Q2189175) (← links)
• The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
• A parallel bio-inspired shortest path algorithm (Q2218449) (← links)
• Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
• Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
• Message lower bounds via efficient network synchronization (Q2292919) (← links)