Links for fulltext
     (May Require Subscription)
Supplementary

postgraduate thesis: Efficient algorithms for disjoint paths problems in grids

TitleEfficient algorithms for disjoint paths problems in grids
Authors
Issue Date1999
PublisherThe University of Hong Kong (Pokfulam, Hong Kong)
Citation
Chan, W. [陳宏達]. (1999). Efficient algorithms for disjoint paths problems in grids. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3010649
DegreeDoctor of Philosophy
SubjectPaths and cycles (Graph theory)
Computer algorithms.
Dept/ProgramComputer Science and Information Systems

 

DC FieldValueLanguage
dc.contributor.authorChan, Wun-tat.-
dc.contributor.author陳宏達-
dc.date.issued1999-
dc.identifier.citationChan, W. [陳宏達]. (1999). Efficient algorithms for disjoint paths problems in grids. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3010649-
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/B30106497-
dc.subject.lcshPaths and cycles (Graph theory)-
dc.subject.lcshComputer algorithms.-
dc.titleEfficient algorithms for disjoint paths problems in grids-
dc.typePG_Thesis-
dc.identifier.hkulb3010649-
dc.description.thesisnameDoctor of Philosophy-
dc.description.thesislevelDoctoral-
dc.description.thesisdisciplineComputer Science and Information Systems-
dc.description.naturepublished_or_final_version-
dc.description.natureabstract-
dc.description.naturetoc-
dc.identifier.doi10.5353/th_b3010649-
dc.date.hkucongregation2000-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats