UNORDERED TREE CONTRACTION
| dc.citation.epage | 349 | en_US |
| dc.citation.spage | 347 | en_US |
| dc.citation.volume | 497 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | HSU, LH | en_US |
| dc.contributor.author | WANG, JJJ | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:05:23Z | |
| dc.date.available | 2014-12-08T15:05:23Z | |
| dc.date.issued | 1991 | en_US |
| dc.description.abstract | The tree contraction problem is for reducing a rooted tree to its root by a sequence of independent vertex removals. All of the previous research works are concentrated on ordered rooted tree whereas in this paper we are going to discuss the case of unordered rooted tree. | en_US |
| dc.identifier.issn | 0302-9743 | en_US |
| dc.identifier.journal | LECTURE NOTES IN COMPUTER SCIENCE | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3925 | |
| dc.identifier.wosnumber | WOS:A1991FW90100035 | |
| dc.language.iso | en_US | en_US |
| dc.title | UNORDERED TREE CONTRACTION | en_US |
| dc.type | Article | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: