Minimum congestion spanning trees in planar graphs

Details Minimum congestion spanning trees in planar graphs Minimum congestion spanning trees in planar graphs

2009-09-22

arxiv.org/abs/0909.3903v1

Discrete Mathematics, 310 (2010), no. 6-7, 1204-1209

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Minimum congestion spanning trees in planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimum congestion spanning trees in planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum congestion spanning trees in planar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-300422