✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 71 || The complexity of restricted minimum spanning tree problems

✍ Scribed by Maurer, Hermann A.

Book ID: 121479139
Publisher: Springer Berlin Heidelberg
Year: 1979
Weight: 459 KB
Category: Article
ISBN: 354035168X
DOI: 10.1007/3-540-09510-1_36

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 14 || Composition of automata

✍ Loeckx, J. 📂 Article 📅 1974 ⚖ 785 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 944 || Bicriteria network design problems

✍ Fülöp, Zoltán; Gécseg, Ferenc 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 741 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 5125 || The Complexity of Boolean Formula Minimization

✍ Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólf 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 462 KB

The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully rev

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 267 || Parallel construction of a suffix tree

✍ Ottmann, Thomas 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 956 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 71 || Investigating programs in terms of partial graphs

✍ Maurer, Hermann A. 📂 Article 📅 1979 🏛 Springer Berlin Heidelberg ⚖ 848 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 267 || On the languages accepted by finite reversible automata

✍ Ottmann, Thomas 📂 Article 📅 1987 🏛 Springer Berlin Heidelberg ⚖ 471 KB