Two lower bounds for generalized 3-connectivity of Cartesian product graphs.

Hui Gao Benjian Lv Kaishun Wang

Published in: Appl. Math. Comput. (2018)

Keyphrases

cartesian product
lower bound
upper bound
branch and bound algorithm
graph matching
branch and bound
objective function
worst case
upper and lower bounds
topological information
connected components
vc dimension
sample size
directed graph
graph theoretic
linear programming relaxation
lower bounding
multi agent