334 search results - page 6 / 67 » Efficient Algorithms for the Tree Homeomorphism Problem |
BIBM
2008
IEEE
14 years 2 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
RTA
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
INFOCOM
2000
IEEE
14 years 24 days ago
2000
IEEE
— The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. After addressing the characteristics of wireless netw...
ACSC
2002
IEEE
14 years 1 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...