✦ LIBER ✦

An Algorithmic Theory of Numbers, Graphs and Convexity || Front Matter

✍ Scribed by Lovász, László

Book ID: 118169407
Publisher: Society for Industrial and Applied Mathematics
Year: 1986
Weight: 176 KB
Volume: 10.1137/1.9781611970203
Category: Article
ISBN: 1611970202
DOI: 10.1137/1.9781611970203.fm

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithmic Theory of Numbers, Graphs

An Algorithmic Theory of Numbers, Graphs and Convexity || Back Matter

✍ Lovász, László 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics ⚖ 215 KB

An Algorithmic Theory of Numbers, Graphs

An Algorithmic Theory of Numbers, Graphs and Convexity || Introduction

✍ Lovász, László 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics ⚖ 399 KB

Entropy numbers of convex hulls and an a

Entropy numbers of convex hulls and an application to learning algorithms

✍ I. Steinwart 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 115 KB

An algorithm for obtaining the chromatic

An algorithm for obtaining the chromatic number and an optimal coloring of a graph

✍ S.I. Roschke; A.L. Furtado 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 579 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