Computing and Combinatorics: 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings
Springer, Sep 21, 2001 - Computer science - 602 pages
This book constitutes the refereed proceedings of the 7th Annual International Conference on Computing and Combinatorics, COCOON 2001, held in Guilin, China, in August 2001. The 50 revised full papers and 16 short papers presented were carefully reviewed and selected from 97 submissions. The papers are organized in topical sections on complexity theory, computational biology, computational geometry, data structures and algorithms, games and combinatorics, graph algorithms and complexity, graph drawing, graph theory, online algorithms, randomized and average-case algorithms, Steiner trees, systems algorithms and modeling, and computability.
What people are saying - Write a review
We haven't found any reviews in the usual places.
LogSpace Constructive Universal Traversal Sequences
Program Schemes Queues the Recursive Spectrum and ZeroOne Laws
42 other sections not shown
Other editions - View all
approximation algorithm assignment assume Berlin Heidelberg 2001 binary blue interval called chordal graph circumcenter colors competitive ratio complexity Computer Science consider constant constraints construction contains convex corresponding cost defined Delaunay deleted denote deque discrete distance dominating set edge edge-coloring edit mapping endpoints exists function given graph G input integer intersection interval graphs keypoints Kraft's inequality labeled trees Lemma length linear LNCS lower bound matching maximum mesh minimal separator minimum multiple sequence alignment Nh(u node NP-complete NP-hard obtained operations optimal pair paper PC-tree perfect graph planar planar graphs polygon polynomial prefix free code problem Proc program schemes Proof prove queue radius-edge ratio real number root satisfies schedule segment shortest path simulation solution Springer-Verlag Berlin Heidelberg stacks Steiner points Steiner tree subgraph subset Theorem treewidth triangulation undirected graph update upper bound variables vector vertex vertices Voronoi Voronoi diagram Wang weight