9 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.DS2008★ 9 cited
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
Frank Gurski
In this paper we compare and illustrate the algorithmic use of graphs of bounded tree-width and graphs of bounded clique-width. For this purpose we give polynomial time algorithms…
cs.DS2007
A note on module-composed graphs
Frank Gurski
In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of one-vertex insertions v_1,...,v_n, such that the neighbourhood of vertex v_i, 2<…
cs.DS2007
Polynomial algorithms for protein similarity search for restricted mRNA structures
Frank Gurski
In this paper we consider the problem of computing an mRNA sequence of maximal similarity for a given mRNA of secondary structure constraints, introduced by Backofen et al. in [BNS…