Algorithms and Computational Complexity

  • Li X
  • Sun Y
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… has a rainbow … rainbow connection number 2, asking whether a given partial red–blue coloring can be completed to obtain a rainbow connected graph, to the problem of subset rainbow …

Cite

CITATION STYLE

APA

Li, X., & Sun, Y. (2012). Algorithms and Computational Complexity (pp. 15–23). https://doi.org/10.1007/978-1-4614-3119-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free