1327 search results - page 78 / 266 » Path following algorithm for the graph matching problem |
121
click to vote
EDOC
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
159
Voted
TASE
2010
IEEE
14 years 8 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
119
click to vote
CSR
2009
Springer
15 years 8 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
100
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
104
click to vote
GD
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...