Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle.
Bety Hayat SusantiA. N. M. SalmanRinovia SimanjuntakPublished in: ICGTIS (2015)
Keyphrases
- cartesian product
- upper bound
- lower bound
- worst case
- upper and lower bounds
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- tight bounds
- shortest path
- efficiently computable
- connected components
- endpoints
- upper bounding
- error probability
- concept classes
- average case
- sample complexity
- sample size
- multi dimensional
- active learning