ENGLISH

Computing and Combinatorics: 14th Annual International Conference, COCOON 2008 Dalian, China, June 27-29, 2008 Proceedings

By Xiaodong Hu , Jie Wang (eds.) , Yasuhito Asano , Yuya Miyawaki , Takao Nishizeki (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2008
ISBN
978-3-540-69732-9, 978-3-540-69733-6
DOI
10.1007/978-3-540-69733-6
Language
english
Format
PDF
Filesize
15 MB (15340933 bytes)
Series
Lecture Notes in Computer Science 5092
Edition
1
Pages
680\692
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem.

Similar books