Algorithms : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings. 1st ed. 1990

種類:

電子ブック

責任表示:

edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1990

著者名:

• Asano, Tetsuo.
• Ibaraki, Toshihide.
• Imai, Hiroshi.
• Nishizeki, Takao.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 450

ISBN:

9783540471776 [3540471774]    

注記:

Recent progress in string algorithms -- Selection networks -- Computing edge-connectivity in multiple and capacitated graphs -- Efficient sequential and parallel algorithms for planar minimum cost flow -- Structural analyses on the complexity of inverting functions -- Oracles versus proof techniques that do not relativize -- 20-Relative neighborhood graphs are Hamiltonian -- The K-Gabriel graphs and their applications -- Parallel algorithms for generating subsets and set partitions -- Parallel algorithms for linked list and beyond -- Local tournaments and proper circular arc graphs -- Fast algorithms for the dominating set problem on permutation graphs -- Two probabilistic results on merging -- Randomized broadcast in networks -- On the construction of abstract voronoi diagrams, II -- Searching in higher dimension -- Finding extrema with unary predicates -- Implicitly searching convolutions and computing depth of collision -- Characterization for a family of infinitely many irreducible Equally Spaced Polynomi
This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.

ローカル注記:

学内専用E-BOOKS (local access only)