Exact algorithms for a discrete metric labeling problem

Arnborg, 1989, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math., 23, 11, 10.1016/0166-218X(89)90031-0 Arnborg, 1987, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discr. Methods, 8, 277, 10.1137/0608024 Brandstädt, 1999, Graph classes: A survey Dahlaus, 1994, The complexity of multiterminal cuts, SIAM J. Comput., 23, 864, 10.1137/S0097539792225297 Dirac, 1961, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25, 71, 10.1007/BF02992776 Erdös, 1992, Evolutionary trees: An integer multicommodity max-flow min-cut, Adv. Appl. Math., 13, 375, 10.1016/0196-8858(92)90017-Q Erdös, 1994, On weighted multiway cuts in trees, Math. Program: Series A, 65, 93, 10.1007/BF01581691 Golumbic, 1984, Algorithmic aspects of perfect graphs, 301 J. Kleinberg, É. Tardos, Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields, in: Proc. FOCS’99, 1999, pp. 14–15 Lucertini, 1996, Optimal flow management in flexible assembly systems: The minimal part transfer problem, Syst. Sci., 22, 69 West, 2001