Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Degree-Based Spanning Tree Optimization


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Rs. 3,651

Availability: In stock

  • Product Description

We consider several spanning tree optimization problems all having a measure function which depends only on the degrees of the resulting spanning tree. In addition, all investigated problems are generalizations of the Hamiltonian Path problem and so are NP-hard. As we cannot expect exact polynomial-time solutions, we use the approach of approximation algorithms. We look for a suboptimal solution in polynomial time and prove that it is not farther from the optimal one than a given approximation factor. Beside algorithmic aspects, we also consider the number of spanning tree leaves from a bit more theoretical point of view. We investigate how different graph vulnerability parameters, namely scattering number and cut-asymmetry, are related to the number of spanning tree leaves and that of independent spanning tree leaves. Some of our results are applied for the analysis of the Maximum Internal Spanning Tree problem, while some others give connection to the theory of hamiltonicity. In particular, we give a sufficient condition for the existence of a Hamiltonian path by means of cut-asymmetry.

Product Specifications
SKU :COC24789
AuthorGábor Salamon
Number of Pages120
Publishing Year10/27/2012
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-28 00:00:00