Links for fulltext
     (May Require Subscription)
Supplementary

postgraduate thesis: On the complexity of finding optimal edge rankings

TitleOn the complexity of finding optimal edge rankings
Authors
Issue Date1996
PublisherThe University of Hong Kong (Pokfulam, Hong Kong)
Citation
Yue, F. [余鳳玲]. (1996). On the complexity of finding optimal edge rankings. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3014888
DegreeMaster of Philosophy
SubjectTrees (Graph theory)
Computational complexity.
Dept/ProgramComputer Science

 

DC FieldValueLanguage
dc.contributor.authorYue, Fung-ling.-
dc.contributor.author余鳳玲-
dc.date.issued1996-
dc.identifier.citationYue, F. [余鳳玲]. (1996). On the complexity of finding optimal edge rankings. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3014888-
dc.languageeng-
dc.publisherThe University of Hong Kong (Pokfulam, Hong Kong)-
dc.relation.ispartofHKU Theses Online (HKUTO)-
dc.rightsThe author retains all proprietary rights, (such as patent rights) and the right to use in future works.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.source.urihttp://hub.hku.hk/bib/B30148881-
dc.subject.lcshTrees (Graph theory)-
dc.subject.lcshComputational complexity.-
dc.titleOn the complexity of finding optimal edge rankings-
dc.typePG_Thesis-
dc.identifier.hkulb3014888-
dc.description.thesisnameMaster of Philosophy-
dc.description.thesislevelMaster-
dc.description.thesisdisciplineComputer Science-
dc.description.naturepublished_or_final_version-
dc.description.natureabstract-
dc.description.naturetoc-
dc.identifier.doi10.5353/th_b3014888-
dc.date.hkucongregation1997-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats