Combinatorial Algorithms [electronic resource] : 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers / edited by Costas S. Iliopoulos, William F. Smyth.
Contributor(s): Iliopoulos, Costas S [editor.] | Smyth, William F [editor.] | SpringerLink (Online service).
Material type: BookSeries: Theoretical Computer Science and General Issues: 7056Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XI, 387 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642250118.Subject(s): Computer science -- Mathematics | Discrete mathematics | Algorithms | Machine theory | Artificial intelligence -- Data processing | Discrete Mathematics in Computer Science | Algorithms | Formal Languages and Automata Theory | Data Science | Symbolic and Algebraic ManipulationAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online In: Springer Nature eBookSummary: 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.No physical items for this record
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.