Journal: Networks

Found 487 papers in total
Approximating reduced costs under degeneracy in a network flow problem with side constraints
Approximating reduced costs under degeneracy in a network flow problem with side constraints
1996,
Reduced costs obtained from the optimal simplex tableau are not necessarily correct...
A method for obtaining the maximum multiroute flows in a network
A method for obtaining the maximum multiroute flows in a network
1996,
In a communication network, a multiroute channel is more reliable than is an ordinary...
Routing in quasi torus networks
Routing in quasi torus networks
1996,
A routing scheme is presented for a class of mesh topologies, which include tori and...
Embedding grids into grids: Techniques for large compression ratios
Embedding grids into grids: Techniques for large compression ratios
1996,
We return to the problem of embedding 2-dimensional (h × w) guest grid graphs...
Node fault tolerance in graphs
Node fault tolerance in graphs
1996,
A graph G* is a k -node fault-tolerant supergraph of a graph G, denoted k -NFT...
Uniformly least reliable graphs
Uniformly least reliable graphs
1996,
The all-terminal reliability (ATR) of an undirected graph G , denoted as R ( G, q ),...
A linear time algorithm to recognize circular permutation graphs
A linear time algorithm to recognize circular permutation graphs
1996,
An undirected graph G is a circular permutation graph if it can be represented by the...
Complexity of spanning tree problems with leaf-dependent objectives
Complexity of spanning tree problems with leaf-dependent objectives
1996,
We consider the problem of finding an optimal spanning tree with respect to objective...
Star-factors and k-bounded total domination
Star-factors and k-bounded total domination
1996,
In this paper, we consider a variation of total domination in which we limit the...
A comparative study of doubly connected directed topologies for local area networks and multi access networks
A comparative study of doubly connected directed topologies for local area networks and multi access networks
1996,
This article provides an overview of doubly linked networks. We first classify the...
Components and graph automorphisms of standard 2 × 2-switch banyan networks
Components and graph automorphisms of standard 2 × 2-switch banyan networks
1996,
The standard networks of this paper are the Omega network of Lawrie and its various...
Disconnecting sets in single and two-terminal-pair networks
Disconnecting sets in single and two-terminal-pair networks
1996,
We consider mixed networks, which may include both directed and undirected edges. For...
Transmitting on various network topologies
Transmitting on various network topologies
1996,
Architectures for interconnection networks can be represented by graphs, while...
Circuit-switched row-column broadcasting in torus and mesh networks
Circuit-switched row-column broadcasting in torus and mesh networks
1996,
This paper is concerned with broadcasting on 2-dimensional torus and mesh networks...
Broadcasting with universal lists
Broadcasting with universal lists
1996,
In broadcasting, information originally held in one node of a communication network...
Optimally edge fault-tolerant trees
Optimally edge fault-tolerant trees
1996,
We study the structure of fault-tolerant multiprocessor systems that allow one or more...
Minimum gossip bus networks
Minimum gossip bus networks
1996,
Gossiping is an information dissemination problem in which each node of a...
Package routing in transportation networks with fixed vehicle schedules
Package routing in transportation networks with fixed vehicle schedules
1996,
We consider a special case of the general problem involving the routing of packages...
Network synthesis with few edges
Network synthesis with few edges
1996,
The network synthesis problem introduced by Gomory and Hu is to construct a network...
A feedback strategy for periodic network flows
A feedback strategy for periodic network flows
1996,
We consider a dynamic network flow model for the control problem of a...
A modified Melzak procedure for computing node-weighted Steiner trees
A modified Melzak procedure for computing node-weighted Steiner trees
1996,
Given a set of points in the Euclidean plane, the standard Steiner Problem asks for a...
An optimal algorithm for the mixed Chinese postman problem
An optimal algorithm for the mixed Chinese postman problem
1996,
The Chinese Postman Problem is well solved when the original graph contains only arcs...
Stochastic shortest path problems with recourse
Stochastic shortest path problems with recourse
1996,
We consider shortest path problems defined on graphs with random arc costs. We assume...
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph
1996,
Let G denote an interval graph with n vertices and unit weight edges. In this paper,...
Papers per page: