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

Keyphrases

• Galled Networks 100%
• Convex Recoloring 100%
• Tree Network 100%
• Tight Lower Bound 100%
• Graph Coloring 100%
• Tighter Upper Bound 100%
• Underlying Graph 66%
• Fixed-parameter Algorithms 33%
• Partial Coloring 33%
• Network Size 33%
• Communication Networks 33%
• Arbitrary Network 33%
• Amortized Analysis 33%
• Transportation Network 33%
• Connected Subgraphs 33%
• Novel Technique 33%
• Recoloring 33%
• Convex Coloring 33%
• Total Coloring 33%
• Phylogenetic Network 33%

Mathematics

• Lower and upper bounds 100%
• Convex 100%
• Running Time 10%