21 search results - page 5 / 5 » Tree Canonization and Transitive Closure |
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...