✦ LIBER ✦

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 5874 || Evaluation of Recoverable-Robust Timetables on Tree Networks

✍ Scribed by Fiala, Jiří; Kratochvíl, Jan; Miller, Mirka

Book ID: 120660207
Publisher: Springer Berlin Heidelberg
Year: 2009
Weight: 265 KB
Category: Article
ISBN: 3642102174
DOI: 10.1007/978-3-642-10217-2_6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || Contraction of Timetable Networks with Realistic Transfers

✍ Festa, Paola 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 191 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 7643 || On the Steiner Radial Number of Graphs

✍ Arumugam, S.; Smyth, W. F. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 174 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial and Algorithmic Aspects of Networking Volume 4852 || Combinatorial Algorithms for Listing Paths in Minimal Change Order

✍ Janssen, Jeannette; Prałat, Paweł 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 462 KB

[Lecture Notes in Computer Science] Disc

[Lecture Notes in Computer Science] Discovery Science Volume 5808 || A Comparison of Community Detection Algorithms on Artificial Networks

✍ Gama, João; Costa, Vítor Santos; Jorge, Alípio Mário; Brazdil, Pavel B. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 288 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 1848 || Linear Bidirectional On-Line Construction of Affix Trees

✍ Giancarlo, Raffaele; Sankoff, David 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 310 KB

This Book Constitutes The Refereed Proceedings Of The 11th Annual Symposium On Combinatorial Pattern Matching, Cpm 2000, Held In Montreal, Canada, In June 2000.the 29 Revised Full Papers Presented Together With 3 Invited Contributions And 2 Tutorial Lectures Were Carefully Reviewed And Selected From

[Lecture Notes in Computer Science] Dist

[Lecture Notes in Computer Science] Distributed Computing and Networking Volume 4904 || Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks

✍ Rao, Shrisha; Chatterjee, Mainak; Jayanti, Prasad; Murthy, C. Siva Ram; Saha, Sa 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 309 KB