Journal: Annals of Discrete Mathematics

Found 7 papers in total
Edge-packings of graphs and network reliability
Edge-packings of graphs and network reliability
1988,
The reliability of a network can be efficiently bounded using graph-theoretical...
On clustering problems with connected optima in Euclidean spaces
On clustering problems with connected optima in Euclidean spaces
1989,
Let X be a finite subset of a Euclidean space, and ρ be a real function defined on...
An on-line graph coloring algorithm with sublinear performance ratio
An on-line graph coloring algorithm with sublinear performance ratio
1989,
One of the simplest heuristics for obtaining a proper coloring of a graph is the...
Large scale network analysis with applications to transportation, communication and inference networks
Large scale network analysis with applications to transportation, communication and inference networks
1988,
The study of large scale networks has been mainly motivated by practical problems....
A simple linear expected time algorithm for finding a Hamiltonian path
A simple linear expected time algorithm for finding a Hamiltonian path
1989,
The paper gives a simple algorithm which either finds a hamilton path between two...
Logic-based decision support
Logic-based decision support
1989,
This monograph is directly based on a series of ten lectures, of the same title, given...
Surveys in Combinatorial Optimization
Surveys in Combinatorial Optimization
1987,
What is nowadays referred to as ‘Combinatorial Optimization, derives from the...
Papers per page: