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: 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 ...

The project is a pattern matching tool in the domain of graphs. Graph A is considered a pattern in graph B, when A is a (optionally induced) subgraph, minor, or topological minor of B. Besides being ...

The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, ...

The statistical physics of graphs and partition functions represents a vibrant intersection of graph theory, statistical mechanics and computational complexity. By summing over an ensemble of ...

Notebook 1. Simulation of a mutual matching experiment from a set of encoding functions. Here we show why data obtained with a matching procedure cannot fully determine the encoding functions that ...

In order to investigate which models are more applicable under different ride-sourcing markets, a paper published in Communications in Transportation Research (COMMTR) builds a simulator to simulate ...

This group consists of CALL RXCHANGE, CALL RXFREE, CALL RXSUBSTR, RXMATCH, and RXPARSE, and comprises the character string matching category for functions and CALL routines. For a description, see ...