Jayakumar, Rajagopalan (1984) Design and analysis of graph algorithms : spanning tree enumeration, planar embedding and maximal planarization. PhD thesis, Concordia University.
Preview |
Text (application/pdf)
12MBNL30667.pdf |
| Item Type: | Thesis (PhD) |
|---|---|
| Authors: | Jayakumar, Rajagopalan |
| Pagination: | xviii, 354 leaves : ill. ; 29 cm. |
| Institution: | Concordia University |
| Degree Name: | Ph. D. |
| Program: | Electrical and Computer Engineering |
| Date: | 1984 |
| Identification Number: | QA 166 J38X 1984 |
| ID Code: | 2921 |
| Deposited By: | lib-batchimporter |
| Deposited On: | 27 Aug 2009 19:22 |
| Last Modified: | 13 Jul 2020 19:53 |
| Related URLs: |
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.
Repository Staff Only: item control page
Download Statistics
Download Statistics