Keyword: graphs

Found 1175 papers in total
Broadcasting in DMA-bound bounded degree graphs
Broadcasting in DMA-bound bounded degree graphs
1992,
Broadcasting is an information dissemination process in which a message is to be sent...
Minimum broadcast digraphs
Minimum broadcast digraphs
1992,
Broadcasting is an information dissemination process in which a message is to be sent...
The covering radius of Hadamard codes in odd graphs
The covering radius of Hadamard codes in odd graphs
1992,
The use of odd graphs has been proposed as fault-tolerant interconnection networks....
Search problems with switching costs
Search problems with switching costs
1992,
This article is a simple survey on search problems on a finite and linear graph, in...
Capacitated vehicle routing on trees
Capacitated vehicle routing on trees
1991,
T=(V,E) is a tree with nonnegative weights associated with each of its vertices. A...
An O(n) bound for the diameter of transshipment polytopes
An O(n) bound for the diameter of transshipment polytopes
1992,
The diameter of any transshipment polytope associated to the complete directed graph...
Parallel algorithms for the maximal tree cover problems
Parallel algorithms for the maximal tree cover problems
1992,
A maximal l- diameter tree cover of a graph G=(V,E) is a spanning subgraph C=(V,E C )...
A linear-time algorithm for computing all 3-edge-connected components of a multigraph
A linear-time algorithm for computing all 3-edge-connected components of a multigraph
1992,
The subject of the paper is to propose a simple O(ℝ Vℝ+ℝEℝ)...
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
1991,
The graphical relaxation of the Traveling Salesman Problem is the relaxation obtained...
The Traveling Salesman Problem in graphs with some excluded minors
The Traveling Salesman Problem in graphs with some excluded minors
1992,
Given a graph and a length function defined on its edge-set, the Traveling Salesman...
A multiperiod traveling salesman problem: Heuristic algorithms
A multiperiod traveling salesman problem: Heuristic algorithms
1992,
This paper deals with a particular traveling salesman problem in which the cities must...
On alternative p-center problems
On alternative p-center problems
1992,
Let G=(V,E) be an undirected connected graph with positive edge lengths. The vertex p-...
Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
1991,
An exact algorithm is presented for determining the interval chromatic number of a...
Structural properties of matroid matchings
Structural properties of matroid matchings
1992,
This paper refines Lovasz’s duality theory for the linear matroid parity problem...
Complexity of vector optimization problems on graphs
Complexity of vector optimization problems on graphs
1991,
The paper is dedicated to the computation complexity of multi-objective optimization...
The crown inequalities for the Symmetric Traveling Salesman Polytope
The crown inequalities for the Symmetric Traveling Salesman Polytope
1992,
The authors define a new family of valid inequalities for the Symmetric Traveling...
A Bernoulli excursion and its various applications
A Bernoulli excursion and its various applications
1991,
This paper is concerned with a random walk process in which and for . This process is...
Fuzzy graphs in the evaluation and optimization of networks
Fuzzy graphs in the evaluation and optimization of networks
1992,
Referring to some predecessing models the paper introduces the concept of fuzzy vertex...
Narrowness, pathwidth, and their application in natural language processing
Narrowness, pathwidth, and their application in natural language processing
1992,
In the syntactic theory of Tesnière the structural description of sentences are...
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
1992,
An edge coloring model is presented for a preemptive open shop problem. Constraints...
An exactly optimal strategy for a search problem with traveling cost
An exactly optimal strategy for a search problem with traveling cost
1991,
There are n neighboring cells in a straight line. An object is in one of the cells. It...
Combinatorial aspects of construction of competition in the Dutch Professional Football Leagues
Combinatorial aspects of construction of competition in the Dutch Professional Football Leagues
1992,
Competitions are defined as a set of meetings between a number of clubs at preset...
A search game with traveling cost
A search game with traveling cost
1991,
There are n neighboring cells in a striaght line. A man selects a cell, hides in it...
Numerically robust divide-and-conquer algorithm for constructing Voronoi diagrams
Numerically robust divide-and-conquer algorithm for constructing Voronoi diagrams
1991,
The paper presents a method to make the divide-and-conquer algorithm for constructing...
Papers per page: