3396 search results - page 550 / 680 » Tree representations of graphs |
142
click to vote
PSTV
1993
15 years 6 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
139
Voted
DSS
2006
15 years 4 months ago
2006
Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of con...
137
click to vote
IJAC
2008
15 years 4 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
122
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...