Journal: Networks

Found 487 papers in total
2-diameter of de Bruijn graphs
2-diameter of de Bruijn graphs
1996,
This paper shows that in the undirected binary de Bruijn graph of dimension n, UB(n) ,...
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
1996,
We present a simple optimal algorithm for the problem of finding maximum independent...
Divide-and-conquer algorithms for graph-layout problems
Divide-and-conquer algorithms for graph-layout problems
1996,
Tutte introduced a decomposition of 2-connected graphs which has widely been used in...
On the connectivity and the conditional diameter of graphs and digraphs
On the connectivity and the conditional diameter of graphs and digraphs
1996,
Recently, it was proved that if the diameter D of a graph G is small enough in...
On eccentric vertices in graphs
On eccentric vertices in graphs
1996,
The eccentricity e(v) of a vertex v in a connected graph G is the distance between v...
Magic labeling in graphs: Bounds, complexity, and an application to a variant of travelling salesman problem
Magic labeling in graphs: Bounds, complexity, and an application to a variant of travelling salesman problem
1996,
Let G be an undirected graph with n vertices and m edges. A natural number λ is...
The bottleneck graph partition problem
The bottleneck graph partition problem
1996,
The bottleneck graph partition problem is to partition the nodes of a graph into two...
Efficient path and vertex exchange in Steiner tree algorithms
Efficient path and vertex exchange in Steiner tree algorithms
1997,
Steiner's problem in a weighted graph requires a tree of minimum total weight spanning...
Algorithms for computing message delay for wireless networks
Algorithms for computing message delay for wireless networks
1997,
In this paper, we consider the problem of computing the expected message delay in a...
Fault-tolerant minimum broadcast networks
Fault-tolerant minimum broadcast networks
1996,
Broadcasting is the task of transmitting a message originated at one processor of a...
Broadcasting in synchronous networks with dynamic faults
Broadcasting in synchronous networks with dynamic faults
1996,
The problem of broadcasting in a network is to disseminate information from one node...
Routing algorithms for switching networks with probabilistic traffic
Routing algorithms for switching networks with probabilistic traffic
1996,
Switching networks with probabilistic traffic are positioned prominently in...
A new method for efficient symbolic propagation in discrete Bayesian networks
A new method for efficient symbolic propagation in discrete Bayesian networks
1996,
This paper presents a new efficient method for uncertainty propagation in discrete...
Minimal rankings
Minimal rankings
1996,
A k -ranking, f , for a graph G is a function f:V(G) →{1,2,...,k} such that if u,...
Topological network design of state-dependent queueing networks
Topological network design of state-dependent queueing networks
1996,
Topological network design problems often contain nodes and arcs where the stochastic...
Vulnerability of scheduled networks and a generalization of Menger's theorem
Vulnerability of scheduled networks and a generalization of Menger's theorem
1996,
An edge-scheduled network N is a multigraph G = ( V, E ), where each edge e ∈ E...
Fault-tolerant broadcasting and gossiping in communication networks
Fault-tolerant broadcasting and gossiping in communication networks
1996,
Broadcasting and gossiping are fundamental tasks in network communication. In...
The multilevel hypercube: A hierarchical hypercube network
The multilevel hypercube: A hierarchical hypercube network
1996,
In this paper, we present and analyze a new network called the Multilevel Hypercube...
An approximation scheme for some Steiner tree problems in the plane
An approximation scheme for some Steiner tree problems in the plane
1996,
We design a polynomial-time approximation scheme for the Steiner tree problem in the...
Optimal packet fragmentation and routing in computer networks
Optimal packet fragmentation and routing in computer networks
1997,
The packet fragmentation problem in computer networks is that of breaking a packet...
A lower bound for interval routing in general networks
A lower bound for interval routing in general networks
1997,
Interval routing is a space-efficient routing method for point-to-point communication...
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
1997,
In this paper, we present a branch-and-cut algorithm for the exact solution of an...
The tree center problems and the relationship with the bottleneck knapsack problems
The tree center problems and the relationship with the bottleneck knapsack problems
1997,
The tree center problems are designed to find a subtree minimizing the maximum...
A tabu search algorithm for the capacitated shortest spanning tree problem
A tabu search algorithm for the capacitated shortest spanning tree problem
1997,
The Capacitated Shortest Scanning Tree Problem consists of determining a shortest...
Papers per page: