A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti
[article]
2019
arXiv
pre-print
We consider the problem of computing the strong rainbow connection number src(G) for cactus graphs G in which all cycles have odd length. We present a formula to calculate src(G) for such odd cacti which can be evaluated in linear time, as well as an algorithm for computing the corresponding optimal strong rainbow edge coloring, with polynomial worst case run time complexity. Although computing src(G) is NP-hard in general, previous work has demonstrated that it may be computed in polynomial
arXiv:1912.11906v1
fatcat:4oohmzky5vgovjwrewmtvi2spa