2283 search results - page 440 / 457 » Bounds of Graph Characteristics |
CORR
2008
Springer
15 years 16 days ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
COR
2006
15 years 15 days ago
2006
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
108
Voted
CGA
2007
15 years 13 days ago
2007
abstract painting and practice can benefit information visualization—even though the two fields have significantly different objectives. This comparison reflects the spirit of ...
84
Voted
KI
2008
Springer
15 years 12 days ago
2008
Springer
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
115
click to vote
TPDS
2010
14 years 10 months ago
2010
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...