Results 271 to 280 of about 120,423 (316)
Some of the next articles are maybe not open access.
Networks, 2006
AbstractIn this article, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, link failures, network survivability, etc., we introduce a new notion of flow spanner, where one seeks a spanning subgraph H = (V, E') of a graph G = (V, E) which provides a ...
Feodor F. Dragan, Chenyu Yan
openaire +1 more source
AbstractIn this article, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, link failures, network survivability, etc., we introduce a new notion of flow spanner, where one seeks a spanning subgraph H = (V, E') of a graph G = (V, E) which provides a ...
Feodor F. Dragan, Chenyu Yan
openaire +1 more source
Estimation of flows in flow networks
European Journal of Operational Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ron Zohar, Dan Geiger
openaire +1 more source
IEEE Control Systems Letters, 2017
We consider flow-inducing networks, a class of models that are well-suited to describe important biochemical systems, including the MAPK pathway and the interactions at the trans-Golgi network. A flow-inducing network is given by the interconnection of subsystems (modules), each associated with a stochastic state matrix whose entries depend on the ...
Giordano G., Blanchini F.
openaire +2 more sources
We consider flow-inducing networks, a class of models that are well-suited to describe important biochemical systems, including the MAPK pathway and the interactions at the trans-Golgi network. A flow-inducing network is given by the interconnection of subsystems (modules), each associated with a stochastic state matrix whose entries depend on the ...
Giordano G., Blanchini F.
openaire +2 more sources
Operations Research Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ariel Orda, Raphael Rom
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ariel Orda, Raphael Rom
openaire +2 more sources
IEEE Transactions on Information Theory, 2000
Summary: We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to
Ahlswede, Rudolf +3 more
openaire +1 more source
Summary: We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to
Ahlswede, Rudolf +3 more
openaire +1 more source
Operations Research, 1972
This paper considers a directed capacitated network in which the supply at each source node and the demand at each sink node is a linear function of a parameter t. It presents two algorithms that determine the range of values for the parameter t; they correspond to the primal and dual linear-programming algorithms that solve this problem.
openaire +2 more sources
This paper considers a directed capacitated network in which the supply at each source node and the demand at each sink node is a linear function of a parameter t. It presents two algorithms that determine the range of values for the parameter t; they correspond to the primal and dual linear-programming algorithms that solve this problem.
openaire +2 more sources
2013
Identifying ‘networked flow’ as the key driver of networked creativity, this new volume in the Springer Briefs series deploys concepts from a range of sub-disciplines in psychology to suggest ways of optimizing the innovative potential of creative networks.
Gaggioli, Andrea +3 more
openaire +3 more sources
Identifying ‘networked flow’ as the key driver of networked creativity, this new volume in the Springer Briefs series deploys concepts from a range of sub-disciplines in psychology to suggest ways of optimizing the innovative potential of creative networks.
Gaggioli, Andrea +3 more
openaire +3 more sources
1987
A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time
Bogdan S. Chlebus +2 more
openaire +1 more source
A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time
Bogdan S. Chlebus +2 more
openaire +1 more source
2000
Maximum flow problems appear in many practical applications. In this paper, we study how to simplify a given directed flow network by finding edges that can be removed without changing the value of the maximum flow. We give a number of approaches which are increasingly more complex and more time-consuming, but in exchange they remove more and more ...
Therese C. Biedl +2 more
openaire +1 more source
Maximum flow problems appear in many practical applications. In this paper, we study how to simplify a given directed flow network by finding edges that can be removed without changing the value of the maximum flow. We give a number of approaches which are increasingly more complex and more time-consuming, but in exchange they remove more and more ...
Therese C. Biedl +2 more
openaire +1 more source