Keyword: graphs

Found 1175 papers in total
Geometrical solution to some planar constrained minimax problems involving the weighted rectilinear metric
Geometrical solution to some planar constrained minimax problems involving the weighted rectilinear metric
1992,
The problem of locating a single service centre catering to the demands of customers...
An example of chromatic scheduling
An example of chromatic scheduling
1992,
A brief description is given of an application of chromatic scheduling in chemical...
Gainfree Leontief substitution flow problems
Gainfree Leontief substitution flow problems
1992,
Leontief substitution systems have been studied by economists and operations...
Tour construction algorithm for the capacitated arc routing problems
Tour construction algorithm for the capacitated arc routing problems
1992,
In this paper, the authors consider an exact algorithm for the capacitated arc routing...
A constructive approach to electric power distribution planning
A constructive approach to electric power distribution planning
1990,
The paper is concerned with the problem of power distribution planning which remains...
Set to set broadcasting in communication networks
Set to set broadcasting in communication networks
1992,
Suppose G=(V,E) is a graph whose vertices represent people and edges represent...
The Steiner problem on rectilinear metrics
The Steiner problem on rectilinear metrics
1990,
This paper is a survey about the Rectilinear Steiner Tree Problem, where the authors...
The homogeneity deficit of a network and its reduction
The homogeneity deficit of a network and its reduction
1991,
The paper introduces the concept of the homogeneity deficit of a network, considers...
The Process Allocation Problem: A survey of the application of graph-theoretic and integer programming approaches
The Process Allocation Problem: A survey of the application of graph-theoretic and integer programming approaches
1992,
The Process Allocation Problem, which consists of allocating a number of processes to...
The binested inequalities for the Symmetric Travelling Salesman Polytope
The binested inequalities for the Symmetric Travelling Salesman Polytope
1992,
This paper defines a family of valid inequalities for the Symmetric Travelling...
An object-oriented simulation environment for airbase logistics
An object-oriented simulation environment for airbase logistics
1992,
The subject of this paper, the Integrated Model Development Environment (IMDE),...
The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs
The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs
1992,
A set E' of k edges in a multigraph G=(V,E) is said to be a k most vital edge set ( k-...
Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning
Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning
1991,
This is the second in a series of three papers that empirically examine the...
Solving linear bottleneck assignment problems via strong spanning trees
Solving linear bottleneck assignment problems via strong spanning trees
1992,
An efficient algorithm for solving the n×n linear bottleneck assignment problem...
Optimal schemes for disseminating information and their fault tolerance
Optimal schemes for disseminating information and their fault tolerance
1992,
The authors describe two information disseminating schemes, t-disseminate and t-R...
Strongly polynomial algorithms for the high multiplicity scheduling problem
Strongly polynomial algorithms for the high multiplicity scheduling problem
1991,
A high multiplicity scheduling problem consists of many jobs which can be partitioned...
Processor interconnection networks from Cayley graphs
Processor interconnection networks from Cayley graphs
1992,
Cayley graphs of groups are presently being considered by the computer science...
Computational complexity of a cost allocation approach to a fixed cost spanning forest problem
Computational complexity of a cost allocation approach to a fixed cost spanning forest problem
1992,
The authors present a computational analysis of a game theoretic approach to a cost...
Locating facilities which interact: Some solvable cases
Locating facilities which interact: Some solvable cases
1993,
The network version of the m- median problem with mutual communication is to find the...
A survey of integrity
A survey of integrity
1991,
A communication network can be considered to be highly vulnerable to disruption if the...
Connections between two cycles-A new design of dense processor interconnection networks
Connections between two cycles-A new design of dense processor interconnection networks
1992,
In this paper the authors attempt to maximize the order of graphs of given degree...
New methods for using Cayley graphs in interconnection networks
New methods for using Cayley graphs in interconnection networks
1992,
A number of researchers have proposed Cayley graphs and Schreier coset graphs as...
The forwarding index of communication networks with given connectivity
The forwarding index of communication networks with given connectivity
1992,
Answering some questions of Heydemann, Meyer, Opatrny and Sotteau, the authors give...
Connectivity, persistence and fault diagnosis of interconnection networks based on Ok and 2Ok graphs
Connectivity, persistence and fault diagnosis of interconnection networks based on Ok and 2Ok graphs
1992,
Various fault-tolerance performance parameters including enumeration of openly...
Papers per page: