6740 search results - page 980 / 1348 » An s -Hamiltonian Line Graph Problem |
163
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
183
click to vote
VLSID
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
186
click to vote
SIGCSE
2000
ACM
15 years 11 months ago
2000
ACM
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
187
click to vote
ICDCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In a distributed environment where nodes are independently motivated, many transactions or commercial exchanges may be stymied due to a lack of trust between the participants. The...
156
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...