Sciweavers

821 search results - page 46 / 165
» Addressing the Petersen graph
Sort
View
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
15 years 6 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu
CEAS
2005
Springer
15 years 5 months ago
Comparative Graph Theoretical Characterization of Networks of Spam
Email is an increasingly important and ubiquitous means of communication, both facilitating contact between individuals and enabling rises in the productivity of organizations. Ho...
Luíz Henrique Gomes, Rodrigo B. Almeida, Lu...
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
15 years 5 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
DSN
2003
IEEE
15 years 5 months ago
A Voltage Scheduling Heuristic for Real-Time Task Graphs
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
Diganta Roychowdhury, Israel Koren, C. Mani Krishn...
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 4 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...