: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
Zhi Zhang, Haoyang Che, Pengfei Shi, Yong Sun, Jun...
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...