Breadcrumb

 
 

Reachability and sequencing in marked graphs and state graphs : algorithms based on network programming

Title:

Reachability and sequencing in marked graphs and state graphs : algorithms based on network programming

Comeau, Marc Andrew (1986) Reachability and sequencing in marked graphs and state graphs : algorithms based on network programming. PhD thesis, Concordia University.

[img]
Preview
PDF
8Mb

Divisions:Concordia University
Item Type:Thesis (PhD)
Authors:Comeau, Marc Andrew
Pagination:xii, 214 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:Theses (Ph.D.)
Date:1986
ID Code:4066
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 15:35
Last Modified:08 Dec 2010 10:36
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