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