Abstract: Classical graph matching aims to find a node correspondence between two unlabeled graphs of known topologies. This problem has a wide range of applications, from matching identities in ...

ABSTRACT: The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision ...

Abstract: Neuro-transfer function (neuro-TF) methods are increasingly applied in the parametric modeling of microwave passive devices. Current neuro-TF methods based on poles/residues have the problem ...

ABSTRACT: The optimal semi-matching problem is one relaxing form of the maximum cardinality matching problems in bipartite graphs, and finds its applications in load balancing. Ordered binary decision ...