100 search results - page 3 / 20 » Closure and factor-critical graphs |
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
49
Voted
DM
2010
14 years 9 months ago
2010
54
Voted
DM
2000
14 years 9 months ago
2000
73
Voted
ACSC
2003
IEEE
15 years 2 months ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
64
Voted
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...