Breadcrumb

 
 

Design and analysis of graph algorithms : spanning tree enumeration, planar embedding and maximal planarization

Title:

Design and analysis of graph algorithms : spanning tree enumeration, planar embedding and maximal planarization

Jayakumar, Rajagopalan (1984) Design and analysis of graph algorithms : spanning tree enumeration, planar embedding and maximal planarization. PhD thesis, Concordia University.

[img]
Preview
PDF
12Mb

Divisions:Concordia University
Item Type:Thesis (PhD)
Authors:Jayakumar, Rajagopalan
Pagination:xviii, 354 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:Theses (Ph.D.)
Date:1984
ID Code:2921
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 15:22
Last Modified:08 Dec 2010 10:29
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

Document Downloads

More statistics for this item...

Concordia University - Footer