๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An NC algorithm for the clique cover problem in cocomparability graphs and its application

โœ Scribed by Chongkye Rhee; Y.Daniel Liang

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
322 KB
Volume
57
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An SST-based algorithm for the steiner p
An SST-based algorithm for the steiner problem in graphs
โœ J. E. Beasley ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 644 KB

In this paper we consider the Steiner problem in graphs which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph. We present a formulation of the problem as a shortest spanning tree (SST) problem with additional constraints. By relaxing these addition