Spanning trees and optimization problems / Bang Ye Wu and Kun-Mao Chao
Material type:
TextSeries: Discrete mathematics and its applicationsPublication details: Boca Raton : Chapman and Hall, 2004Description: xv, 184p, 23cmISBN: - 1584884363
- 511.52 WUB
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
Book
|
Calcutta | 511.52 WUB (Browse shelf(Opens below)) | Available | IIMC-122069 |
Browsing Calcutta shelves Close shelf browser (Hides shelf browser)
| No cover image available |
|
|
|
|
|
|
||
| 511.5024004 ALA Graph theory with applications to algorithms and computer science / | 511.5024004 ALA Graph theory with applications to algorithms and computer science / | 511.502855 KNU The Stanford graph base : | 511.52 WUB Spanning trees and optimization problems / | 511.56 CHA Chromatic graph theory / | 511.56 WER Graph colouring and variations / | 511.56 WIL Four colors suffice : |
Spanning trees play an important role in the design of efficient routing algorithms and help solve computationally hard problems like the Steiner tree and the traveling salesperson problem. This is one of the most important concepts used in graph theory, as it forms the foundation of many theoretical results in practical fields like scheduling, clustering, data mining, and many others. Spanning Trees and Optimization Problems is the first book published on the use and applications associated with the modern study of spanning trees. It covers properties of spanning trees first, followed by the three categories of spanning trees: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees
There are no comments on this title.