221 search results - page 6 / 45 » Graph matching with type constraints on nodes and edges |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
ACIVS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
APPROX
2006
Springer
13 years 11 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...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...