On minimum average stretch spanning trees in polygonal 2-trees
From MaRDI portal
Publication:2339451
Recommendations
Cites work
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- A partial k-arboretum of graphs with bounded treewidth
- A tight upper bound on the probabilistic embedding of series-parallel graphs
- Algorithms for Generating Fundamental Cycles in a Graph
- Chromatic equivalence classes of certain generalized polygon trees
- Chromatic equivalence classes of certain generalized polygon trees. III
- Chromaticity of series-parallel graphs
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Graph theory
- scientific article; zbMATH DE number 3853133 (Why is no real title available?)
- scientific article; zbMATH DE number 3508539 (Why is no real title available?)
- scientific article; zbMATH DE number 3024665 (Why is no real title available?)
- Introduction to algorithms.
- Labelled and unlabelled enumeration of k-gonal 2-trees
- Minimal cycle bases of outerplanar graphs
- Minimum cycle bases of Halin graphs
- On the approximability of the minimum strictly fundamental cycle basis problem
- Parallel recognition of series-parallel graphs
- The specification of 2-trees
- The zoo of tree spanner problems
Cited in
(2)
This page was built for publication: On minimum average stretch spanning trees in polygonal 2-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339451)