Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Geometry

Buy Now

Coloring of Trees (Paperback) Loot Price: R1,583
Discovery Miles 15 830
Coloring of Trees (Paperback): Tanveer Awal, M. Mahbubuzzaman

Coloring of Trees (Paperback)

Tanveer Awal, M. Mahbubuzzaman

 (sign in to rate)
Loot Price R1,583 Discovery Miles 15 830 | Repayment Terms: R145 pm x 12*

Bookmark and Share

Expected to ship within 7 - 11 working days

Add a Casual Day Sticker for R20

Vertex and edge coloring have their diverse applications in problems such as time tabling and scheduling, frequency assignment for spectrum, register allocation, pattern matching, analysis of biological and archeological data, etc. An l-vertex-coloring is a generalized version of the vertex coloring of a graph with integers that asks assigning colors to vertices such that any two vertices u and v get different colors if dist(u, v) is at most l, where dist(u, v) denotes the length of the shortest path between u and v in G, l being a nonnegative integer. A coloring is optimal if it uses minimum number of distinct colors. The l-vertex-coloring problem is to find an optimal l-vertex-coloring of a graph G. An l-edge-coloring is defined similar to the l-vertex-coloring problem on G. Both l-vertex-coloring and l-edge-coloring problems are NP-hard in general. In this research work, we present polynomial time algorithms for both l-vertex-coloring and l-edge-coloring of trees. We also compute the upper bound of number of colors to be used in l-vertex-coloring. This book will especially be helpful to researchers in Graph Theory, Computational Geometry, Algorithms and Scheduling


Imprint: VDM Verlag
Country of origin: Germany
Release date: May 2011
First published: May 2011
Authors: Tanveer Awal • M. Mahbubuzzaman
Dimensions: 229 x 152 x 4mm (L x W x T)
Format: Paperback - Trade
Pages: 60
ISBN-13: 978-3-639-35293-1
Categories: Books > Science & Mathematics > Mathematics > Geometry > General
LSN: 3-639-35293-9
Barcode: 9783639352931

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!