✦ LIBER ✦

NP-completeness of minimum spanner problems

✍ Scribed by Leizhen Cai

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 544 KB
Volume: 48
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90073-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-Completeness of graph decomposition p

NP-Completeness of graph decomposition problems

✍ Edith Cohen; Michael Tarsi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 689 KB

NP-completeness of some edge-disjoint pa

NP-completeness of some edge-disjoint paths problems

✍ Jens Vygen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB

NP-complete scheduling problems

✍ J.D. Ullman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 423 KB

We show that the problem of finding an optimal schedule for a set of jobs is NPcomplete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processor resolving (in the negative a conjecture of R. L. Grah

NP-completeness of a family of graph-col

NP-completeness of a family of graph-colouring problems

✍ Robert W. Irving 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 417 KB

On the np-completeness of certain networ

On the np-completeness of certain network testing problems

✍ S. Even; O. Goldreich; S. Moran; P. Tong 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 946 KB

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sen

Minimum spanners of butterfly graphs

✍ Shien-Ching Hwang; Gen-Huey Chen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB