88 search results - page 12 / 18 » On Graph Powers for Leaf-Labeled Trees |
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
JDA
2008
13 years 7 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
GG
2004
Springer
14 years 26 days ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
GD
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
TPDS
2008
13 years 7 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...