FINDING A MAXIMUM SET OF INDEPENDENT CHORDS IN A CIRCLE
| dc.citation.epage | 102 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 99 | en_US |
| dc.citation.volume | 41 | en_US |
| dc.citation.woscount | 3 | |
| dc.contributor.author | CHANG, RC | en_US |
| dc.contributor.author | LEE, HS | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:05:00Z | |
| dc.date.available | 2014-12-08T15:05:00Z | |
| dc.date.issued | 1992-02-14 | en_US |
| dc.description.abstract | In 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.identifier.doi | 10.1016/0020-0190(92)90262-T | en_US |
| dc.identifier.issn | 0020-0190 | en_US |
| dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/0020-0190(92)90262-T | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3521 | |
| dc.identifier.wosnumber | WOS:A1992HF69200007 | |
| dc.language.iso | en_US | en_US |
| dc.subject | CIRCLE GRAPH | en_US |
| dc.subject | COMBINATORIAL PROBLEMS | en_US |
| dc.subject | COMPUTATIONAL GEOMETRY | en_US |
| dc.subject | MAXIMUM INDEPENDENT SET | en_US |
| dc.subject | POLYGON DECOMPOSITION | en_US |
| dc.title | FINDING A MAXIMUM SET OF INDEPENDENT CHORDS IN A CIRCLE | en_US |
| dc.type | Article | en_US |