𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1979 Volume 74 || A reduct-and-closure algorithm for graphs

✍ Scribed by Bečvář, Jiří

Book ID
118018432
Publisher
Springer Berlin Heidelberg
Year
1979
Weight
292 KB
Category
Article
ISBN
3540350888

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Math
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2001 Volume 2136 || Syntactic Semiring of a Language
✍ Sgall, Jiří; Pultr, Aleš; Kolman, Petr 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 136 KB

This Volume Contains Papers Selected For Presentation At The 26th International Symposium On Mathematical Foundations Of Computer Science – Mfcs 2001, Held In Mari´ansk´el´azn?e, Czech Republic, August 27 – 31, 2001. Mfcs 2001 Was Organized By The Mathematical Institute (academy Of S- Ences Of The C

[Lecture Notes in Computer Science] Math
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2007 Volume 4708 || A Linear Time Algorithm for the k Maximal Sums Problem
✍ Kučera, Luděk; Kučera, Antonín 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 536 KB

This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks add