Skip to main content

Computational complexity of graph compaction

Resource type
Thesis
Thesis type
(Thesis) Ph.D.
Date created
1997
Authors/Contributors
Author: Vikas, Narayan
Copyright statement
Copyright is held by the author.
Permissions
The author has not granted permission for the file to be printed nor for the text to be copied and pasted. If you would like a printable copy of this thesis, please contact summit-permissions@sfu.ca.
Scholarly level
Graduate student (PhD)
Subject
Graph theory.
Map-coloring problem.
Homomorphisms (Mathematics)
Language
English
Member of collection
Computing Science Theses
Download file Size
b18721059.pdf 4.62 MB

Views & downloads - as of June 2023

Views: 0
Downloads: 0