Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs.

Emilio Di Giacomo Giuseppe Liotta Tamara Mchedlidze

Published in: WG (2013)

Keyphrases

lower and upper bounds
planar graphs
upper bound
lower bound
upper and lower bounds
lagrangian relaxation
partition function
shortest path
connected components
data sets
branch and bound
branch and bound algorithm
approximation algorithms
weighted graph
approximate inference
parameter estimation
minimum weight