Minimum congestion spanning trees in planar graphs
classification
🧮 math.CO
keywords
congestionspanningapproachgraphsplanartreedevelopestimation
read the original abstract
The main purpose of the paper is to develop an approach to evaluation or estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate the spanning tree congestion of triangular grids.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.