Minimum congestion spanning trees in planar graphs

13 years 4 months ago

Download facpub.stjohns.edu

: The main purpose of the paper is to develop an approach to the evaluation or the estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate the spanning tree congestion of triangular grids.

M. I. Ostrovskii

Real-time Traffic

DM 2010 | Main Purpose | Spanning Tree | Tree Congestion |

claim paper

» The Stackelberg Minimum Spanning Tree Game on Planar and BoundedTreewidth Graphs

» Parametric and Kinetic Minimum Spanning Trees

» Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs

» Congestion Games Optimization in Competition

» Fixedparameter tractability results for fulldegree spanning tree and its dual

» The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs

» Supereulerian planar graphs

» Hierarchical Minimum Spanning Trees for Lossy Image Set Compression

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DM
Authors	M. I. Ostrovskii

Comments (0)

Sciweavers

Minimum congestion spanning trees in planar graphs

DM 2010 | Main Purpose | Spanning Tree | Tree Congestion |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers