𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithmic aspects of partial convexity

✍ Scribed by N. N. Metel’skii; V. G. Naidenko


Book ID
110613848
Publisher
SP MAIK Nauka/Interperiodica
Year
2000
Tongue
English
Weight
816 KB
Volume
68
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Some aspects of convexity
✍ V S Sunder 📂 Article 📅 2000 🏛 Indian Academy of Sciences 🌐 English ⚖ 617 KB
Some aspects of convexity
✍ V. S. Sunder 📂 Article 📅 2000 🏛 Indian Academy of Sciences 🌐 English ⚖ 514 KB
Algorithmic Aspects of Tree Amalgamation
✍ Sebastian Böcker; David Bryant; Andreas W.M. Dress; Mike A. Steel 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 129 KB

The amalgamation of leaf-labeled trees into a single (super)tree that "displays" each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well-known polynomialtime algorithm can be used to solve this problem whenever

Algorithmic Aspects of Neighborhood Numb
✍ Chang, Gerard J.; Farber, Martin; Tuza, Zsolt 📂 Article 📅 1993 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 858 KB