3 search results - page 1 / 1 » Maintaining Longest Paths in Cyclic Graphs |
CP
2005
Springer
13 years 10 months ago
2005
Springer
FCT
2009
Springer
13 years 9 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...