1756 search results - page 29 / 352 » Directed scale-free graphs |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
CCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer