Wyniki wyszukiwania:

The book presents the important fundamental theorems and algorithms on planar graph drawing with easy-to-understand and constructive proofs. Extensively illustrated and with exercises included at the end of each chapter, it is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph theory, graph drawing, information visualization and computational geometry. The book will also serve as a useful reference source for researchers in the field of graph drawing and software developers in information visualization, VLSI design and CAD.

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.