Lower and upper bounds for long induced paths in 3-connected planar graphs.

Emilio Di Giacomo Giuseppe Liotta Tamara Mchedlidze

Published in: Theor. Comput. Sci. (2016)

Keyphrases

lower and upper bounds
planar graphs
lower bound
upper bound
upper and lower bounds
lagrangian relaxation
valid inequalities
branch and bound algorithm
data sets
worst case
itemsets
shortest path
connected components
undirected graph
partition function
branch and bound
weighted graph