1002 search results - page 4 / 201 » Towards Graph Programs for Graph Algorithms |
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
121
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
ESA
2003
Springer
15 years 2 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
IFL
1997
Springer
15 years 1 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...