✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1741 || Constructing the Suffix Tree of a Tree with a Large Alphabet

✍ Scribed by Shibuya, Tetsuo

Book ID: 115457343
Publisher: Springer Berlin Heidelberg
Year: 1999
Tongue: German
Weight: 176 KB
Edition: 1999
Category: Article
ISBN: 3540669167
DOI: 10.1007/3-540-46632-0_24

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the refereed proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99, held in Chennai, India, in December 1999.
The 40 revised full papers presented together with four invited contributions were carefully reviewed and selected from 71 submissions. Among the topics covered are data structures, parallel and distributed computing, approximation algorithms, computational intelligence, online algorithms, complexity theory, graph algorithms, computational geometry, and algorithms in practice.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 1276 || Tree structure genetic algorithm with a nourishment mechanism

✍ Jiang, Tao; Lee, D. T. 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 608 KB

This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms - ESA 2009 Volume 5757 || Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

✍ Fiat, Amos; Sanders, Peter 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 202 KB

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 5431 || On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

✍ Das, Sandip; Uehara, Ryuhei 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 481 KB

[Lecture Notes in Computer Science] Prac

[Lecture Notes in Computer Science] Practical Aspects of Declarative Languages Volume 7149 || A Declarative Specification of Tree-Based Symbolic Arithmetic Computations

✍ Russo, Claudio; Zhou, Neng-Fa 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 249 KB

[Lecture Notes in Computer Science] Math

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

✍ Bečvář, Jiří 📂 Article 📅 1979 🏛 Springer Berlin Heidelberg ⚖ 292 KB

[Lecture Notes in Computer Science] Mach

[Lecture Notes in Computer Science] Machine Learning and Knowledge Discovery in Databases Volume 7523 || Nearly Exact Mining of Frequent Trees in Large Networks

✍ Flach, Peter A.; De Bie, Tijl; Cristianini, Nello 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 313 KB