[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A compact data structure and parallel algorithms for permutation graphs
β Scribed by Nagl, Manfred
- Book ID
- 111963445
- Publisher
- Springer Berlin Heidelberg
- Year
- 1995
- Weight
- 383 KB
- Category
- Article
- ISBN
- 3540484876
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Part of a four-volume set, this book constitutes the refereed proceedings of the 7th International Conference on Computational Science, ICCS 2007, held in Beijing, China in May 2007. The papers cover a large volume of topics in computational science and related areas, from multiscale physics to wire
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15β17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996)