The current state of the art in subgraph isomorphism solving involves using degree as a
value-ordering heuristic to direct backtracking search. Such a search makes a heavy …

When a small pattern graph does not occur inside a larger target graph, we can ask how to
find" as much of the pattern as possible" inside the target graph. In general, this is known as …

For a given pair of pattern and data graphs, the subgraph isomorphism finding problem
locates all instances of the pattern graph into the data graph. For a given subgraph …

Like most doctoral students, I started my studies by reviewing the existing, most prominent
approaches in the field. A couple of months later I thought I had acquired a sufficient …

This thesis improves the state of the art in exact, practical algorithms for finding subgraphs.
We study maximum clique, subgraph isomorphism, and maximum common subgraph …

Application Specific Instruction Set Processors (ASIPs) seek for an optimal
performance/area/energy trade-off for a given algorithm. In all current design methodologies …

RISC-V is a modern open source Instruction Set Architecture (ISA) and designed in a very
extendable manner, which allows for highly application specific solutions. However, the …

The study is introduced under four main sections in this chapter. First, the purpose of the
thesis is explained clearly. Afterwards, a detailed literature review is given in order to …

Short time-to-market and cost consideration of hardware design promotes reuse of ever
more complex intellectual property even up to processors. In processor design, the …

Short-vector SIMD and DSP instructions are popular extensions to common Isas. These
extensions deliver excellent performance and compact code for some compute-intensive …