1986 search results - page 194 / 398 » Path Separability of Graphs |
ECCC
2010
13 years 7 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
SIGMOD
2004
ACM
14 years 10 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
SLS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
WER
2007
Springer
14 years 4 months ago
2007
Springer
Complex information systems have numerous design variables that are systematically decided upon during the design process. In high-variability systems, some of these decisions are...