Login / Signup
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs.
Xingchao Deng
Kai-Nan Xiang
Baoyindureng Wu
Published in:
Appl. Math. Lett. (2012)
Keyphrases
</>
computational complexity
upper bound
graph isomorphism
worst case
np hard
optimal solution
probabilistic model
lower bound
objective function
undirected graph
k means
matching algorithm
graph mining
constant factor
data model
semantic web
graph model
planar graphs