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

Some special cases of the transitivity problem in the theory of graphs

โœ Scribed by L. L. Velikovich

Publisher
Springer US
Year
1983
Tongue
English
Weight
321 KB
Volume
18
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Special cases of the flow-shop problem
Special cases of the flow-shop problem
โœ Wlodzimierz Szwarc ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 385 KB

## Abstract The paper examines all known special cases of the __m__X__n__ flowโ€shop problem. It provides solution procedures to three new special cases along with the optimality proofs. The theory of the new special cases is based on the critical path concept.

Some generalizations of the steiner prob
Some generalizations of the steiner problem in graphs
โœ C. W. Duin; A. Volgenant ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning