𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 314 || Development of several reachability algorithms for directed graphs

✍ Scribed by Göttler, Herbert; Schneider, Hana-Jürgen

Book ID
111949655
Publisher
Springer Berlin Heidelberg
Year
1988
Weight
544 KB
Category
Article
ISBN
3540392645

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Grap
[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 3353 || Lexicographic Breadth First Search – A Survey
✍ Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 245 KB

During Its 30-year Existence, The International Workshop On Graph-theoretic Concepts In Computer Science Has Become A Distinguished And High-quality Computer Science Event. The Workshop Aims At Uniting Theory And Practice By Demonstrating How Graph-theoretic Concepts Can Successfully Be Applied To V