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

Internet

http://scholarbank.nus.edu.sg/handle/10635/39031

Similar Items