Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if both graphs are of equal size and by subisomorphisms if one graph has fewer vertices than the other. Best fit isomorphisms and subisomorphisms amount to solutions of quadratic assignment problems and are computed exactly...

The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.

Two simple approximation algorithms for the minimum k-cut problem are presented. Each algorithm finds a k cut having weight within a factor of (2 2/k) of the optimal. One algorithm is particularly efficient-it requires a total of only n maximum flow computations for finding a set of near-optimal k cuts, one for each value of k between 2 and n.

Fundamental limitations in decentralized control of systems with multivariable zeros are considered. It is shown that arbitrary bandwidth can be obtained with a stable block-diagonal controller, if certain subsystems of the open-loop system fail to have zeros in the right half-plane and a high-frequency condition holds. Implications on control structure design and sequential loop-closuring meth...

We show that for those lattices of Voronoi’s first kind with known obtuse superbasis, a closest lattice point can be computed in O(n) operations where n is the dimension of the lattice. To achieve this a series of relevant lattice vectors that converges to a closest lattice point is found. We show that the series converges after at most n terms. Each vector in the series can be efficiently comp...

The recovery of depth from defocused images involves calcurecovering the depth [2]. lating the depth of various points in a scene by modeling the The problem addressed in this paper is as follows— effect that the focal parameters of the camera have on images Given a scene with object points at unknown depths from acquired with a small depth of field. In the approach to depth the camera, obtain ...

We prove that, for every integer k ≥ 1, every shortest-path metric on a graph of pathwidth k embeds into a distribution over random trees with distortion at most c = c(k), independent of the graph size. A well-known conjecture of Gupta, Newman, Rabinovich, and Sinclair [GNRS04] states that for every minor-closed family of graphs F , there is a constant c(F) such that the multi-commodity max-flo...

In the present paper, we examine model feedback control systems. Because model feedback control is simple, the model feedback control system has been applied in many applications such as the trajectory control of robot manipulators, serially connected tanks, etc. The control structure of the model feedback control system is limited, and nothing has been reported about whether or not model feedb...