Return to search

An approximation algorithm for the maximum leaf spanning arborescence problem

Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/01/15). Includes bibliographical references.

Identiferoai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/316025095
Date January 1900
CreatorsDrescher, Matthew.
Source SetsOCLC
LanguageEnglish
Detected LanguageEnglish

Page generated in 0.0015 seconds