Pages that link to "Item:Q1693164"
From MaRDI portal
The following pages link to Tree spanners of bounded degree graphs (Q1693164):
Displaying 22 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- A note on matchings and spanning trees with bounded degrees (Q1359373) (← links)
- Degree-preserving spanning trees in small-degree graphs (Q1579547) (← links)
- Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three (Q1627193) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Near-optimal bounded-degree spanning trees (Q1840509) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Spanning trees with disjoint dominating and 2-dominating sets (Q2062688) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- (Q5294907) (← links)
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces (Q5300503) (← links)
- (Q5488358) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902514) (← links)
- Tree spanners in planar graphs (Q5928870) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)
