✦ LIBER ✦

Finding Minimum Generators of Path Systems

✍ Scribed by András Frank

No coin nor oath required. For personal study only.

✦ Synopsis

A simple algorithmic proof of a min max theorem of E. Gyo ri on generators of path systems is described. The algorithm relies on Dilworth's theorem.

📜 SIMILAR VOLUMES

Finding minimum rectilinear distance pat

✍ Richard C. Larson; Victor O. K. Li 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

Genetic algorithms for generating minimu

✍ Peter K. Sharpe; Alan G. Chalmers; Adam Greenwood 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Constructing minimum path configurations

✍ Alan G Chalmers; Steve Gregory 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 798 KB

Finding an approximate minimum-link visi

✍ Muhammad H Alsuwaiyel; D.T Lee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

The complexity of finding generalized pa

✍ Pavol Hell; Moshe Rosenfeld 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Finding alternating minimum cost path in

✍ S.P. Bansal 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 112 KB