✦ LIBER ✦

An algorithm for the solution of difference problems by graphs

✍ Scribed by I.V. Fryazinov

Publisher: Elsevier Science
Year: 1970
Weight: 267 KB
Volume: 10
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(70)90164-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Effective algorithms for the solution of

Effective algorithms for the solution of problems for flow graphs

✍ I.A. Faradzhev 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 523 KB

An iterative algorithm for the solution

An iterative algorithm for the solution of difference equations

✍ B.N. Chetverushkin 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 445 KB

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ M. L. Shore; L. R. Foulds; P. B. Gibbons 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ J. E. Beasley 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 579 KB

An algorithm for solution of large eigen

An algorithm for solution of large eigenvalue problems

✍ Duc T. Nguyen; Jasbir S. Arora 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 540 KB

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