Description 
1 online resource (xi, 386 pages) 
Series 
Lecture notes in computer science, 03029743 ; 7056 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 7056


LNCS sublibrary. SL 1, Theoretical computer science and general issues

Summary 
This book constitutes the thoroughly referred postworkshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Vancouver, BC, Canada, in July 2011. The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others 
Analysis 
Computer science 

Data structures (Computer science) 

Computer software 

Computational complexity 

Discrete Mathematics in Computer Science 

Algorithm Analysis and Problem Complexity 

Mathematical Logic and Formal Languages 

Symbolic and Algebraic Manipulation 
Bibliography 
Includes bibliographical references and author index 
Subject 
Combinatorial analysis  Data processing  Congresses


Computational complexity  Congresses


Computer algorithms  Congresses


Informatique.


Combinatorial analysis  Data processing.


Computational complexity.


Computer algorithms.

Genre/Form 
Conference papers and proceedings.

Form 
Electronic book

Author 
Iliopoulos, C. S. (Costas S.)


Smyth, Bill

ISBN 
9783642250118 

3642250114 

3642250106 

9783642250101 
