J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Paper
Separating from the dominant of the spanning tree polytope
Abstract
We study the separation problem for the partition inequalities that define the dominant of the spanning tree polytope of a graph G = (V, E). We show that a most violated inequality can be found by solving at most |V| maximum flow problems. Cunningham (1985) had solved this as a sequence of |E| maximum flow problems. © 1992.
Related
Conference paper
Motion video analysis using planar parallax
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering