✦ LIBER ✦

A linear algorithm for the number of degree constrained subforests of a tree

✍ Scribed by Peter J. Slater

Book ID: 113162476
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 408 KB
Volume: 15
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90103-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear algorithm for the domination nu

A linear algorithm for the domination number of a tree

✍ E. Cockayne; S. Goodman; S. Hedetniemi 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 468 KB

A Polynomial Algorithm for the Degree-Co

A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem

✍ Marshall L. Fisher 📂 Article 📅 1994 🏛 INFORMS 🌐 English ⚖ 236 KB

A linear algorithm for the hamiltonian c

A linear algorithm for the hamiltonian completion number of a tree

✍ Sukhamay Kundu 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Comparison of Algorithms for the Degree

Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

✍ Mohan Krishnamoorthy; Andreas T. Ernst; Yazid M. Sharaiha 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 163 KB

A note on genetic algorithms for degree-

A note on genetic algorithms for degree-constrained spanning tree problems

✍ Zhou, Gengui; Gen, Mitsuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to

A new algorithm for degree-constrained m

A new algorithm for degree-constrained minimum spanning tree based on the reduction technique

✍ Aibing Ning; Liang Ma; Xiaohua Xiong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 163 KB