The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...