1056 search results - page 64 / 212 » Constraint-Based Graph Matching |
210
Voted
ASUNAM
2011
IEEE
14 years 16 days ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
95
Voted
GRAPHICSINTERFACE
2009
14 years 10 months ago
2009
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
106
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
107
Voted
BPM
2005
Springer
15 years 6 months ago
2005
Springer
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...
103
click to vote
CORR
2006
Springer
15 years 17 days ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...