1550 search results - page 100 / 310 » Benchmarking for Graph Transformation |
133
click to vote
DLT
2004
15 years 4 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
103
click to vote
SLP
1997
15 years 4 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
149
Voted
SODA
1997
ACM
15 years 4 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
127
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: Microarray technology produces gene expression data on a genomic scale for an endless variety of organisms and conditions. However, this vast amount of information nee...
137
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...