Sciweavers

1002 search results - page 14 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
61
Voted
IPPS
2006
IEEE
15 years 3 months ago
Towards a parallel framework of grid-based numerical algorithms on DAGs
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
Zeyao Mo, Aiqing Zhang, Xiaolin Cao
ISCOPE
1999
Springer
15 years 1 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
80
Voted
PLDI
2004
ACM
15 years 3 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
15 years 4 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde