## Computing and Combinatorics: First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995. ProceedingsThis book constitutes the proceedings of the First Annual International Conference on Computing and Combinatorics, COCOON '95, held in Xi'an, China in August 1995. The 52 thoroughly refereed full papers and the 22 short presentations included in this volume were selected from a total of 120 submissions. All current aspects of theoretical computer science and combinatorial mathematics related to computing are addressed; in particular, there are sections on complexity theory, graph drawing, computational geometry, databases, graph algorithms, distributed programming and logic, combinatorics, machine models, combinatorial designs, algorithmic learning, algorithms, distributed computing, and scheduling. |

### What people are saying - Write a review

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

### Contents

Complexity Theory | 1 |

Graph Drawing | 21 |

Computational Geometry | 41 |

Copyright | |

41 other sections not shown

### Other editions - View all

### Common terms and phrases

adjacent algorithm apply approximation approximation algorithms assume binary Boolean broadcast called clique clustered graph complexity Computer Science consider constant constraints construct contains Corollary corresponding data structure decision problem defined definition denote deterministic disks distribution dominating set edge edge-coloring elements embedding exists finite formula function genus given graph embeddings graph G hierarchy input integer intersection layout Lemma length linear logn lower bound matrix maximum membership queries minimal minimum spanning tree node NP-complete NP-hard obtain operation optimal paper parallel paramodulation path pebbles planar graph polynomial polynomial-time Pp-comp problem Proc processors Proof properties Proposition prove random randomized algorithm rankability recursive reduced relation respectively result root satisfies sequence solution solve spanning tree step string subgraph subset subtrees suffix tree Suppose Theorem Theory Toeplitz words triangle triangle inequality tuple variables vertex vertices weakly visible weight