✦ LIBER ✦

Efficient computation of tolerances in the weighted independent set problem for trees

✍ Scribed by B. I. Gol’dengorin, D. S. Malyshev, P. M. Pardalos

Book ID: 120813879
Publisher: SP MAIK Nauka/Interperiodica
Year: 2013
Tongue: English
Weight: 161 KB
Volume: 87
Category: Article
ISSN: 1064-5624
DOI: 10.1134/S1064562413030186

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient computation of tolerances in t

Efficient computation of tolerances in the weighted independent set problem for some classes of graphs

✍ Malyshev, D. S.; Pardalos, P. M. 📂 Article 📅 2014 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 190 KB

A tolerance-based heuristic approach for

A tolerance-based heuristic approach for the weighted independent set problem

✍ Goldengorin, B. I.; Malyshev, D. S.; Pardalos, P. M.; Zamaraev, V. A. 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 388 KB

Efficient algorithms for the maximum wei

Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs

✍ Maw-Shang Chang; Fu-Hsing Wang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 246 KB

In the determination of weight sets to c

In the determination of weight sets to compute cross-efficiency ratios in DEA

✍ Lam, K F 📂 Article 📅 2010 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 122 KB

Closed formulas for the numbers of small

Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees

✍ Charles Delorme; Odile Favaron; Dieter Rautenbach 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We derive closed formulas for the numbers of independent sets of size at most 4 and matchings of size at most 3 in graphs without small cycles that depend only on the degree sequence and the products of the degrees of adjacent vertices. As a related problem we describe an algorithm that determines

An efficient parallel algorithm for comp

An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3

✍ Elias Dahlhaus; Marek Karpinski; Pierre Kelsen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 375 KB