WALCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
WALCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern...
WALCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
WALCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
WALCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n