3396 search results - page 8 / 680 » Tree representations of graphs |
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
CPM
2004
Springer
14 years 2 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
PODC
2010
ACM
14 years 17 days ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
CAV
1999
Springer
14 years 29 days ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
IJFCS
2007
13 years 8 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...