317 search results - page 55 / 64 » Computing and Updating the Process Number in Trees |
TCS
2002
13 years 8 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
STACS
1992
Springer
14 years 26 days ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
COMPGEOM
2006
ACM
14 years 16 days ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
CLADE
2008
IEEE
14 years 3 months ago
2008
IEEE
With the exponential growth of complete genome sequences, the analysis of these sequences is becoming a powerful approach to build genome-scale metabolic models. These models can ...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
With the rapid growth of computer networks and network infrastructures and increased dependency on the internet to carry out day-to-day activities, it is imperative that the compo...