Sciweavers

1477 search results - page 54 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
CAAN
2007
Springer
15 years 4 months ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Implication of assertion graphs in GSTE
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
Guowu Yang, Jin Yang, William N. N. Hung, Xiaoyu S...
AGTIVE
2007
Springer
15 years 4 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß
ICPP
1999
IEEE
15 years 2 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 1 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali