This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in Sanya, Hainan, China in December 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms.Laminar Structure of Ptolemaic Graphs and Its Applications Ryuhei Uehara1 and Yushi Uno2 1 School of Information Science, Japan Advanced ... In this paper, a new characterization of ptolemaic graphs is presented. ... in linear time, and it is called a clique tree since each node of the tree corresponds to a maximal clique of the chordal graph (see ). ... The class of distance hereditary graphs was introduced by Howorka to deal with the distance property called isometric . For theanbsp;...
|Title||:||Algorithms and Computation|
|Author||:||Xiaotie Deng, Dingzhu Du|
|Publisher||:||Springer Science & Business Media - 2005-12-09|