731 search results - page 90 / 147 » Reductions to Graph Isomorphism |
160
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
134
click to vote
NJC
2006
15 years 3 months ago
2006
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
134
click to vote
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
131
click to vote
WABI
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
113
Voted
SAT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...