Return to search

Implementations and analysis of three parallel branch-and-bound algorithms for the vertex covering problem / Implementations and analysis of 3 parallel branch-and-bound algorithms for the vertex covering problem.

No description available.
Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.66011
Date January 1986
CreatorsZariffa, Nohad.
PublisherMcGill University
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Formatapplication/pdf
CoverageMaster of Science (School of Computer Science.)
RightsAll items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.
Relationalephsysno: 000242040, proquestno: AAIML31278, Theses scanned by UMI/ProQuest.

Page generated in 0.002 seconds