Tree Spanners
From MaRDI portal
Publication:4847362
Recommendations
Cited in
(95)- Bounds on the Spanner-Sum of Torus
- On spanning 2-trees in a graph
- An improved algorithm for computing all the best swap edges of a tree spanner
- The zoo of tree spanner problems
- Graph spanners: a tutorial review
- Spanning tree congestion of k-outerplanar graphs
- Parameterized complexity of the spanning tree congestion problem
- Minimum weight Euclidean t-spanner is NP-hard
- Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- Lower bounds on treespan
- The minimum centroid branch spanning tree problem
- On central spanning trees of a graph
- On approximating tree spanners that are breadth first search trees
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Spanners in sparse graphs
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Approximating minimum MAX-stretch spanning trees on unweighted graphs
- Collective tree spanners in graphs with bounded parameters
- General variable neighborhood search for the minimum stretch spanning tree problem
- Optimal tree 3-spanners in directed path graphs
- The minimum stretch spanning tree problem for typical graphs
- Tree 3-spanners on generalized prisms of graphs
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \)
- Hardness and efficiency on \(t\)-admissibility for graph operations
- Distance Approximating Trees: Complexity and Algorithms
- 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
- On tree-\(t\)-spanners in graphs
- On tree-\(t\)-spanners in graphs
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Distance approximating spanning trees
- Complexity results for the spanning tree congestion problem
- A Faster Computation of All the Best Swap Edges of a Tree Spanner
- Collective additive tree spanners for circle graphs and polygonal graphs
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Graphs with minimum spanner \(\varsigma(G)\geq2\rho-1\)
- Network flow spanners
- Well-partitioned chordal graphs
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- Low complexity variants of the arrow distributed directory
- NP-completeness of minimum spanner problems
- scientific article; zbMATH DE number 1773095 (Why is no real title available?)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Tree spanners of bounded degree graphs
- Optimality computation of the minimum stretch spanning tree problem
- Max-stretch reduction for tree spanners
- ON SPANNERS OF GEOMETRIC GRAPHS
- Better hardness results for the minimum spanning tree congestion problem
- Tree spanners on chordal graphs: complexity and algorithms
- Semi‐labeled unrooted binary tree optimization subject to nonnegativity
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Spanners of bounded degree graphs
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- Minimum \(t\)-spanners on subcubic graphs
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- Isomorphic tree spanner problems
- scientific article; zbMATH DE number 1979496 (Why is no real title available?)
- Three problems on well-partitioned chordal graphs
- Minimum spanners of butterfly graphs
- Polynomial algorithms for sparse spanners on subcubic graphs
- NP-hardness and fixed-parameter tractability of the minimum spanner problem
- Approximating \(k\)-spanner problems for \(k>2\)
- Hardness and efficiency on minimizing maximum distances in spanning trees
- 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
- Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes
- Edge tree spanners
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
- Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs
- Minimax flow tree problems
- A Survey on Spanning Tree Congestion
- Swapping labeled tokens on graphs
- Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently
- New results on edge-coloring and total-coloring of split graphs
- Computing geometric minimum-dilation graphs is NP-hard
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Additive tree 2-spanners of permutation graphs
- Better hardness results for the minimum spanning tree congestion problem
- A distance approximating trees
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- scientific article; zbMATH DE number 434687 (Why is no real title available?)
- Spanners and message distribution in networks.
- Distance domination and amplifier placement problems
- Sorting on graphs by adjacent swaps using permutation groups
- scientific article; zbMATH DE number 1696535 (Why is no real title available?)
- Algorithms and Data Structures
- Spanning trees with disjoint dominating and 2-dominating sets
- A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Tree-decompositions with bags of small diameter
This page was built for publication: Tree Spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847362)
