CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Minimum congestion spanning trees in planar graphs
Authors
M. I. Ostrovskii
Publication date
21 September 2009
Publisher
Doi
Cite
View
on
arXiv
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
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 04/05/2017
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/06/2019