Combinatorial Algorithms [electronic resource] : 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers / edited by Costas S. Iliopoulos, William F. Smyth.
By: Iliopoulos, Costas S [editor.].
Contributor(s): Smyth, William F [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 7056Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XI, 387 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642250118.Subject(s): Computer science | Data structures (Computer science) | Computer software | Computational complexity | Algebra -- Data processing | Computer Science | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Mathematical Logic and Formal Languages | Data Structures | Symbolic and Algebraic ManipulationDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer eBooksSummary: This book constitutes the thoroughly referred post-workshop 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.
This book constitutes the thoroughly referred post-workshop 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.
There are no comments for this item.