4074 search results - page 276 / 815 » Abstract Graph Transformation |
158
click to vote
ASIACRYPT
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
178
click to vote
PPAM
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
142
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
130
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
152
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...