1002 search results - page 50 / 201 » Towards Graph Programs for Graph Algorithms |
185
click to vote
OOPSLA
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
137
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
152
click to vote
JIB
2006
15 years 6 months ago
2006
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
191
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
180
click to vote
LCPC
1999
Springer
15 years 10 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...