1550 search results - page 95 / 310 » Benchmarking for Graph Transformation |
132
click to vote
ICAPR
2005
Springer
15 years 8 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
110
click to vote
DIS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
105
click to vote
EOR
2010
15 years 3 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
179
click to vote
ENDM
2000
15 years 3 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
113
Voted
JOT
2006
15 years 3 months ago
2006
Model transformation has become one of the most focused research field, motivated by for instance the OMG's Model-Driven Architecture (MDA). Metamodeling is a central techniq...