Sciweavers

2270 search results - page 131 / 454
» On the distribution of eigenvalues of graphs
Sort
View
ECCC
2006
123views more  ECCC 2006»
15 years 6 months ago
A Note on Adaptivity in Testing Properties of Bounded Degree Graphs
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
Sofya Raskhodnikova, Adam Smith
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
15 years 6 months ago
Short Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
IPPS
2006
IEEE
16 years 11 days ago
Performance analysis of parallel programs via message-passing graph traversal
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...
Matthew J. Sottile, Vaddadi P. Chandu, David A. Ba...
IPPS
2003
IEEE
15 years 11 months ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...
IPPS
1998
IEEE
15 years 10 months ago
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
Benjamin S. Macey, Albert Y. Zomaya