221 search results - page 23 / 45 » Graph matching with type constraints on nodes and edges |
TON
2008
13 years 7 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
SIROCCO
2010
13 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
DNA
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
SIGADA
1999
Springer
13 years 12 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...