Keyword: graphs

Found 1175 papers in total
Optimal layout of edge-weighted forests
Optimal layout of edge-weighted forests
1999,
The layout problem for trees with weighted edges is motivated by the design of...
Matrices with maximum exponents in the class of doubly stochastic primitive matrices
Matrices with maximum exponents in the class of doubly stochastic primitive matrices
1999,
We characterize those doubly stochastic, primitive matrices for which the bounds for...
Constrained weighted matchings and edge coverings in graphs
Constrained weighted matchings and edge coverings in graphs
1999,
We introduce the problem of finding a maximum weight matching in a graph such that the...
A note on formulations for the A-partition problem on hypergraphs
A note on formulations for the A-partition problem on hypergraphs
1999,
Let H = (V,E) be an undirected hypergraph and A ⊆ V . We consider the problem of...
Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
1999,
The rectilinear Steiner tree problem is to find a minimum-length rectilinear...
Mission planning for synthetic aperture radar surveillance
Mission planning for synthetic aperture radar surveillance
1999,
The Microwave Radar Division of the Defence Sciences and Technology Organisation...
Data-dependent bounds for the general and the asymmetric stacker–crane problems
Data-dependent bounds for the general and the asymmetric stacker–crane problems
1999,
The Stacker–Crane Problem (SCP) is a sequencing problem, arising in scheduling...
On a multconstrained model for chromatic scheduling
On a multconstrained model for chromatic scheduling
1999,
A graph coloring model is described for handling some types of chromatic scheduling...
Retractions of finite distance functions onto tree metrics
Retractions of finite distance functions onto tree metrics
1999,
Trees with positively weighted edges induce a natural metric on any subset of...
A subpath ejection method for the vehicle routing problem
A subpath ejection method for the vehicle routing problem
1998,
Generically, ejection chains are methods conceived to allow solution transformations...
An improved approximation ratio for the minimum latency problem
An improved approximation ratio for the minimum latency problem
1998,
Given a tour visiting n points in a metric space, the latency of one of these points p...
GRASP and path relinking for 2-layer straight line crossing minimization
GRASP and path relinking for 2-layer straight line crossing minimization
1999,
In this article, we develop a greedy randomized adaptive search procedure for the...
Dynamic-programming and graph optimization problems
Dynamic-programming and graph optimization problems
1994,
Several classes of graph optimization problems, which can be solved using dynamic...
Explicit sufficient invariants for an interacting particle system
Explicit sufficient invariants for an interacting particle system
1998,
We introduce a new class of interacting particle systems on a graph G . Suppose...
Permutation of sparse matrices to a specific lower block triangular form using graph decompositions
Permutation of sparse matrices to a specific lower block triangular form using graph decompositions
1998,
A new partitioning algorithm that permutes sparse matrices to a specific block...
Minimal cost linkages in graphs
Minimal cost linkages in graphs
1999,
In this paper, we consider the problem of finding minimal cost linkages in graphs. We...
Another simple proof of the validity of Nagamochi and Ibaraki's min-cut algorithm and Queyranne's extension to symmetric submodular function minimization
Another simple proof of the validity of Nagamochi and Ibaraki's min-cut algorithm and Queyranne's extension to symmetric submodular function minimization
1998,
M. Stoer and F. Wagner and independently A. Frank have found a simple proof of the...
An efficient approximation algorithm for the survivable network design problem
An efficient approximation algorithm for the survivable network design problem
1998,
The survivable network design problem is to construct a minimum-cost subgraph...
An efficient algorithm for the minimum-range ideal problem
An efficient algorithm for the minimum-range ideal problem
1999,
Suppose we are given a partially ordered set, a real-valued weight associated with...
A branch and bound algorithm for the stability number of a sparse graph
A branch and bound algorithm for the stability number of a sparse graph
1998,
We present a branch and bound algorithm for finding a maximum stable set in a graph....
Compact scheduling in open shop with zero–one time operations
Compact scheduling in open shop with zero–one time operations
1999,
A problem of no-wait scheduling of zero–one time operations in an open shop...
A cell formation algorithm: Hypergraph approximation – cut tree
A cell formation algorithm: Hypergraph approximation – cut tree
1998,
A new cell formation technique is presented and analyzed in this paper. The cell...
Modeling and solving a real-life assignment problem at universities
Modeling and solving a real-life assignment problem at universities
1998,
A real-life problem of assigning students to exams during an examination period is...
Improving the performances of part dispatching based on multiple process plans using graph theory
Improving the performances of part dispatching based on multiple process plans using graph theory
1998,
An intrinsic characteristic for manufacturing a part is the existence of diverse...
Papers per page: