|
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910483901203321 |
|
|
Titolo |
Algorithms and Computation : 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings / / edited by Sudebkumar Prasant Pal, Kunihiko Sadakane |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2014.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 362 p. 107 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8344 |
|
|
|
|
|
|
Classificazione |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Computer graphics |
Discrete Mathematics in Computer Science |
Mathematical Applications in Computer Science |
Symbolic and Algebraic Manipulation |
Computer Graphics |
Kongress2014.Chennai |
Kongress2013.Kharagpur (West Bengal) |
Conference papers and proceedings. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and author index. |
|
|
|
|
|
|
Nota di contenuto |
|
Computational Geometry -- Algorithms and Approximations -- Distributed Computing and Networks.-Â Graph Algorithms -- Complexity and Bounds -- Graph Embeddings and Drawings. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the revised selected papers of the 8th International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014. The 29 full papers presented together with 3 invited talks were carefully reviewed and selected from 62 submissions. The papers are organized in topical sections on computational geometry, algorithms and approximations, |
|
|
|
|
|
|
|
|
|
|
distributed computing and networks, graph algorithms, complexity and bounds, and graph embeddings and drawings. |
|
|
|
|
|
| |