Minimum congestion spanning trees in planar graphs
M.I. Ostrovskii
TL;DR
This paper introduces a method to evaluate the spanning tree congestion in planar graphs, specifically applied to triangular grids, aiding in understanding network efficiency and congestion.
Contribution
It presents a novel approach for estimating spanning tree congestion in planar graphs, with a focus on triangular grid structures.
Findings
Effective evaluation method for planar graph congestion
Application to triangular grid networks
Insights into network congestion management
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Complexity and Algorithms in Graphs