A split graph is a whose vertex set can be partitioned into clique and stable set. Given G weight function \(w: V(G) \rightarrow \mathbb {Q}_{\ge 0}\), the Split Vertex Deletion (SVD) problem asks to find minimum of vertices X such that \(G-X\) graph. It easy show if only it does not contain 4-cycle, 5-cycle, or two edge matching as an induced subgraph. Therefore, SVD admits 5-approximation alg...

Evolutionary histories for species that cross with one another or exchange genetic material can be represented by leaf-labelled, directed graphs called phylogenetic networks . A major challenge in the burgeoning area of is to develop algorithms building such amalgamating small into a single large network. The level network measure its deviation from being tree; higher network, less treelike it ...

due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...