1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, RCen_US
dc.contributor.authorLEE, HSen_US
dc.date.accessioned2014-12-08T15:05:00Z-
dc.date.available2014-12-08T15:05:00Z-
dc.date.issued1992-02-14en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/0020-0190(92)90262-Ten_US
dc.identifier.urihttp://hdl.handle.net/11536/3521-
dc.description.abstractIn this note we propose an O(nm) algorithm for finding a maximum independent set of m chords which are incident to , vertices on a circle. This result can be applied to improving the time complexity of the algorithm for partitioning simple polygons into a minimum number of uniformly monotone polygons.en_US
dc.language.isoen_USen_US
dc.subjectCIRCLE GRAPHen_US
dc.subjectCOMBINATORIAL PROBLEMSen_US
dc.subjectCOMPUTATIONAL GEOMETRYen_US
dc.subjectMAXIMUM INDEPENDENT SETen_US
dc.subjectPOLYGON DECOMPOSITIONen_US
dc.titleFINDING A MAXIMUM SET OF INDEPENDENT CHORDS IN A CIRCLEen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/0020-0190(92)90262-Ten_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume41en_US
dc.citation.issue2en_US
dc.citation.spage99en_US
dc.citation.epage102en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1992HF69200007-
dc.citation.woscount3-
Appears in Collections:Articles


Files in This Item:

  1. A1992HF69200007.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...