Sciweavers

28 search results - page 1 / 6
» Partitioning graphs of supply and demand
Sort
View
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
13 years 10 months ago
Partitioning graphs of supply and demand
: 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 ...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
JDA
2008
94views more  JDA 2008»
13 years 4 months ago
Approximability of partitioning graphs with supply and demand
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 ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
CCE
2008
13 years 4 months ago
Chemical supply chain network optimization
Chemical supply chain networks provide large opportunities for cost reductions through the redesign of the flow of material from producer to customer. In this paper we present a m...
Jeff Ferrio, John Wassick
ALGORITHMICA
2002
71views more  ALGORITHMICA 2002»
13 years 4 months ago
Routing Flow Through a Strongly Connected Graph
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
Thomas Erlebach, Torben Hagerup
ISM
2006
IEEE
122views Multimedia» more  ISM 2006»
13 years 10 months ago
SuperGraph Visualization
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
José Fernando Rodrigues Jr., Agma J. M. Tra...