✦ LIBER ✦

An algorithm for connectingNpoints with a minimum number of crossings

✍ Scribed by F. Lerda; E. Majorani

Book ID: 110562940
Publisher: Springer Milan
Year: 1964
Tongue: English
Weight: 399 KB
Volume: 1
Category: Article
ISSN: 0008-0624
DOI: 10.1007/bf02576900

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel algorithm for the

An efficient parallel algorithm for the minimum crossing number problem

✍ Rong Long Wang; Kozo Okazaki 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 193 KB

An improved merging algorithm using a mi

An improved merging algorithm using a minimum number of comparisons

✍ E. P. Zabello 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 608 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

An algorithm for the minimum number of t

An algorithm for the minimum number of transport units to maintain a fixed schedule

✍ T. E. Bartlett 📂 Article 📅 1957 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

Determination of minimum number of senso

Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach

✍ Ram Pandit; Placid M. Ferreira 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 647 KB

Minimum number of tardy jobs in single m

Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm

✍ Thuruthickara C. John; Yih-Bor Wu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 352 KB