Some results about minimum cuts, treewidth and hamiltonian circuits by L. Sunil Chandran.
Material type:
BookPublication details: Bangalore : Indian Institute of Science, 2002.Description: i, 97 p. : illDissertation: PhD;2002;Computer Science and AutomationDDC classification: - 511.5028551 P02
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Thesis
|
JRD Tata Memorial Library | 511.5028551 P02 (Browse shelf(Opens below)) | Available | T05332 |
Browsing JRD Tata Memorial Library shelves Close shelf browser (Hides shelf browser)
|
|
No cover image available | No cover image available | No cover image available |
|
|
||
| 511.50285 REI Digital geometry Geometric methods for digital picture analysis | 511.502853 KNU Stanford graphbase by Donald E. Knuth | 511.5028551 N95 Algorithms and characterizations for subclasses of planar perfect graphs | 511.5028551 P02 Some results about minimum cuts, treewidth and hamiltonian circuits | 511.5028551 P03 Approximation algorithms for the K- MST problem | 511.502855369 TRO The mathematica guidebook for graphics / | 511.6 GOD Algebraic graph theory |
Includes references
PhD;2002;Computer Science and Automation
There are no comments on this title.