To facilitate the damping matching of dampers for vehicle passive suspensions, this paper proposes an analytical matching method of the optimal piecewise linear damping characteristics curve. Based on the vehicle vibration model, taking the suspension dynamic deflection as the constraint, by the vibration acceleration and the wheel dynamic load, an objective function about the relative damping ...

Graph similarity computation aims to predict a score between one pair of graphs facilitate downstream applications, such as finding the most similar chemical compounds query compound or Fewshot 3D Action Recognition. Recently, some graph models based on neural networks have been proposed, which are either graph-level interaction node-level comparison. However, when number nodes in increases, it...

Our input instance is a bipartite graph G = (A∪B,E) where A is a set of applicants, B is a set of jobs, and each vertex u ∈ A∪B has a preference list ranking its neighbors in a strict order of preference. For any two matchings M and T in G, let φ(M,T ) be the number of vertices that prefer M to T . A matching M is popular if φ(M,T )≥ φ(T,M) for all matchings T in G. There is a utility function ...

Let G = (V,E) be a graph with positive integral edge weights. Our problem is to find a matching of maximum weight in G. We present a simple iterative algorithm for this problem that uses a maximum cardinality matching algorithm as a subroutine. Using the current fastest maximum cardinality matching algorithms, we solve the maximum weight matching problem in O(W √ nm logn(n /m)) time, or in O(Wn...

a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.

We revisit the pairwise kidney exchange problem established by Roth Sonmez and Unver [23]. Our goal, explained in terms of graph theory, is to find a maximum fractional matching on an undirected graph, that Lorenz-dominates any other fractional matching. The Lorenz-dominant fractional matching, which can be implemented as a lottery of integral matchings, is in some sense the fairest allocation ...

We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems|polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for ...

We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems--polynomial-time solvability, rain-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm fo...