1002 search results - page 119 / 201 » Towards Graph Programs for Graph Algorithms |
125
click to vote
TCOM
2010
15 years 27 days ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
126
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
114
click to vote
ISSTA
2009
ACM
15 years 9 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
143
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
115
Voted
SAC
2008
ACM
15 years 2 months ago
2008
ACM
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...