This thesis consists of two parts. In the second part the research papers that constitute the
new results of the thesis are presented. In this first part we want to put these results in a …

Algorithms used in data mining and bioinformatics have to deal with huge amount of data
efficiently. In many applications, the data are supposed to have explicit or implicit structures …

Let C be a class of graphs. A graph G=(V, E) is C-probe if V (G) can be partitioned into two
sets: non-probes N and probes P, where N is an independent set and new edges may be …

Cographs are those graphs without induced path on four vertices. A graph G is a probe
cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) …

An undirected graph G=(V, E) is a probeC graph if its vertex set can be partitioned into two
sets, N (nonprobes) and P (probes) where N is independent and there exists E′⊆ N× N …

Let CC be a class of graphs. A graph G=(V, E) G=(V, E) is CC–probe if V (G) can be
partitioned into two sets: non-probes NN and probes PP, where NN is an independent set …

Given a class of graphs G, a graph G is a probe graph of G if its vertices can be partitioned
into a set of probes and an independent set of nonprobes such that G can be embedded into …

Some graphs admit drawings in the Euclidean k-space in such a (natural) way, that edges
are represented as line segments of unit length. Such embeddings are called k-dimensional …

Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned
into two sets, ℙ (the probes) and ℕ (the nonprobes), where ℕ is an independent set, such …

Let G denote a graph class. An undirected graph G is called a probe G graph if one can
make G a graph in G by adding edges between vertices in some independent set of G. By …