Vai al contenuto principale della pagina

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



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: 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 Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Edizione: 1st ed. 2011.
Descrizione fisica: 1 online resource (XI, 387 p.)
Disciplina: 511.6
Soggetto topico: Computer science—Mathematics
Discrete mathematics
Algorithms
Machine theory
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Formal Languages and Automata Theory
Data Science
Symbolic and Algebraic Manipulation
Persona (resp. second.): IliopoulosCostas S
SmythWilliam F
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references and index.
Sommario/riassunto: 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.
Titolo autorizzato: Combinatorial Algorithms  Visualizza cluster
ISBN: 3-642-25011-4
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996465937903316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 7056