Partial convex recolorings of trees and galled networks: Tight upper and lower bounds

Partial convex recolorings of trees and galled networks: Tight upper and lower bounds

10.1145/2000807.2000810

Saved in:
Bibliographic Details
Main Authors: Moran, S., Snir, S., Sung, W.-K.
Other Authors: COMPUTER SCIENCE
Format: Article
Published: 2013
Subjects:
Convex recoloring
NP-hardness
Partially colored galled networks
Partially colored trees
Online Access:http://scholarbank.nus.edu.sg/handle/10635/39031
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-39031
record_format dspace
spelling sg-nus-scholar.10635-390312023-10-29T20:02:57Z Partial convex recolorings of trees and galled networks: Tight upper and lower bounds Moran, S. Snir, S. Sung, W.-K. COMPUTER SCIENCE Convex recoloring NP-hardness Partially colored galled networks Partially colored trees 10.1145/2000807.2000810 ACM Transactions on Algorithms 7 4 2013-07-04T07:32:23Z 2013-07-04T07:32:23Z 2011 Article Moran, S., Snir, S., Sung, W.-K. (2011). Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. ACM Transactions on Algorithms 7 (4). ScholarBank@NUS Repository. https://doi.org/10.1145/2000807.2000810 15496325 http://scholarbank.nus.edu.sg/handle/10635/39031 000296200900003 Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Convex recoloring
NP-hardness
Partially colored galled networks
Partially colored trees
spellingShingle Convex recoloring
NP-hardness
Partially colored galled networks
Partially colored trees
Moran, S.
Snir, S.
Sung, W.-K.
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
description 10.1145/2000807.2000810
author2 COMPUTER SCIENCE
author_facet COMPUTER SCIENCE
Moran, S.
Snir, S.
Sung, W.-K.
format Article
author Moran, S.
Snir, S.
Sung, W.-K.
author_sort Moran, S.
title Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
title_short Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
title_full Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
title_fullStr Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
title_full_unstemmed Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
title_sort partial convex recolorings of trees and galled networks: tight upper and lower bounds
publishDate 2013
url http://scholarbank.nus.edu.sg/handle/10635/39031
_version_ 1781410964647706624

Similar Items