Minimum congestion spanning trees in planar graphs
Combinatorics
2010-09-07 v1
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.
Keywords
Cite
@article{arxiv.0909.3903,
title = {Minimum congestion spanning trees in planar graphs},
author = {M. I. Ostrovskii},
journal= {arXiv preprint arXiv:0909.3903},
year = {2010}
}