THE PATH-PARTITION PROBLEM IN BLOCK GRAPHS
| dc.citation.epage | 322 | en_US |
| dc.citation.issue | 6 | en_US |
| dc.citation.spage | 317 | en_US |
| dc.citation.volume | 52 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | YANG, JH | en_US |
| dc.contributor.author | CHANG, GJ | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:03:38Z | |
| dc.date.available | 2014-12-08T15:03:38Z | |
| dc.date.issued | 1994-12-23 | en_US |
| dc.description.abstract | We present a linear-time algorithm for the path-partition problem in block graphs. | en_US |
| dc.identifier.doi | 10.1016/0020-0190(94)00158-8 | 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(94)00158-8 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2171 | |
| dc.identifier.wosnumber | WOS:A1994PX09600006 | |
| dc.language.iso | en_US | en_US |
| dc.subject | ALGORITHMS | en_US |
| dc.subject | GRAPH THEORY | en_US |
| dc.subject | PATH-PARTITION | en_US |
| dc.title | THE PATH-PARTITION PROBLEM IN BLOCK GRAPHS | en_US |
| dc.type | Article | en_US |