Year

1987

Degree Name

Master of Science (Hons.)

Department

Department of Computer Science

Abstract

The and NP-ha ursde porfo lbolceaml ss eaarrec hd aislcguosristehdm. s Dfoura bl optrho pbolelymnso mpliaayl- taimn ei msoplovratbanlet rpoolley nino meisatla-btilmiseh isnogl vtahbel eg plorobballe ompst.i mHaoliwtye vienr ,l oficnadli nsge atrhceh aaplpgroorpirtihamtes dfuoarl palrgoobrlietmhm iss cnaont ab es tcroanigshidtfeorerwd aarsd a t apsrko.m Fisoinr gN aPp-phraoradc phr foobrl ethmesir, laopcparlo sxeimaracthe asolglourtiitohnm, ss, ppercoibaalblyil isinti cc aonnajluynscist,i oann dw piatrha lloetlh ceor mappuptraotiaocnh. esT hleik set udgyre aeldsyo pinrcolbuldeems sa, sausr vweye lol f aost hae rc aapsep rosatucdhye s wfoitrh h asnimdluinlagt iNonP -heaxrpde roimptiemntiss atainodn statistical analyses on an NP-complete bipartite graph drawing problem.

Share

COinS
 

Unless otherwise indicated, the views expressed in this thesis are those of the author and do not necessarily represent the views of the University of Wollongong.