## Algorithms and Computation: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. ProceedingsToshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita This volume gives the proceedings of ISAAC '92, the Third International Symposium on Algorithms and Computation, held in Nagoya, Japan, December 1992. The first symposium was held in Tokyo in 1990, as the first international symposium organized by SIGAL (Special Interest Groupon Algorithms in the Information Processing Society of Japan) to serve as anannual international forum in Asia for researchers in the area of algorithms. The second symposium was held in Taipei, Taiwan in 1991, where it was decided that computation would be included in the main scope of the symposium and that ISAAC would be its name. ISAAC '92 focuses on topics in design and analysis of algorithms, computational complexity, and theory of computation, including algorithms and data structures, parallel/distributed computing, automata and formal languages, probabilistic/approximation algorithms, computability and complexity, term rewriting systems, and computational geometry. The volume contains the accepted contributed papers and the invited papers. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Invited Papers | 1 |

Graph Algorithms I | 21 |

OnLine Algorithms | 61 |

Copyright | |

24 other sections not shown

### Other editions - View all

### Common terms and phrases

approximation algorithms assigned assume binary buses called coloring column complete graph complexity Computational Geometry Computer Science connected consider constant constructed convex cost cutwidth data structure data-items defined denote edges elements exists F-graph finite game tree given graph coloring graph G grid point IEEE input integer intersection interval iteration label layers layout Lemma length linear log2 lower bound matroid maximal maximum minimum multicast node NP-complete number of item O(logn obstacles obtained off-line algorithm on-line algorithm optimal multicast tree optimal solution output pair paper parallel algorithms partition path-decomposition pathwidth permutation permutation graphs planar graph polygon polynomial preprocessing problem Proc procedure processor Proof push sequence query random randomized algorithm recursive segments shortest path solved sorting stack step strings subarray subgraph subproblems subset subtree Theorem total number treewidth vertex vertices visibility graph Voronoi diagram weighted