Algorithms and Computation: 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings (Google eBook)
Kyung-Yong Chwa, Oscar H. Ibarra
Springer, Nov 23, 1998 - Computers - 478 pages
This book constitutes the refereed proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC'98, held in Taejon, Korea, in December 1998.
The 47 revised full papers presented were carefully reviewed and selected from a total of 102 submissions. The book is divided in topical sections on computational geometry, complexity, graph drawing, online algorithms and scheduling, CAD/CAM and graphics, graph algorithms, randomized algorithms, combinatorial problems, computational biology, approximation algorithms, and parallel and distributed algorithms.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
approximation algorithm assume called cell color complexity Computer Science configuration constant constraints construct convex corresponding curve data structure decomposition defined denote distance-hereditary graph dominating set edge edge-connectivity efficient embedding function given Graph Drawing graph G hamiltonian hamiltonian cycle Horn core Horn theories input integer intersection Kd-tree Lemma length linear logn lower bound matching matrix maximal maximum median minimum multigraph node NP-complete NP-hard number of vertices obtained on-line optimal orthogonal orthogonal drawing pair pallet paper pattern planar graphs polyhedron polynomial polytope probability problem Proc processors proof system protocol query random ratio recursive resp result result-correctness root satisfies schedule Section semidefinite program sequence shortest path solution solved source points spanning tree spike stack-up Steiner points sub-cut subgraph subset subtree terminal Theorem trapezoid graphs triangulation two-layer planar variable vector vertex visibility polygon Voronoi diagram zero-knowledge zero-knowledge proof