Treffer: Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings
Title:
Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings
Authors:
Contributors:
Sadakane, Kunihiko, editor.
Publication Year:
2014
Physical Description:
XIV, 362 p. 107 illus. online resource.
Series:
Lecture Notes in Computer Science
Lecture Notes in Computer Science
Lecture Notes in Computer Science
Subject Terms:
Algorithms., Computer graphics., Computer science., Computer software., Computational complexity., Algebra -- Data processing., Algorithm Analysis and Problem Complexity., Discrete Mathematics in Computer Science., Math Applications in Computer Science., Symbolic and Algebraic Manipulation., Data structures (Computer science).
Contents Note:
Computational Geometry -- Algorithms and Approximations -- Distributed Computing and Networks.- Graph Algorithms -- Complexity and Bounds -- Graph Embeddings and Drawings.
Original Identifier:
(Springer)9783319046570
Document Type:
Buch
Book
Language:
English
ISBN:
978-3-319-04657-0
978-3-319-04656-3
3-319-04657-8
3-319-04656-X
978-3-319-04656-3
3-319-04657-8
3-319-04656-X
Rights:
This record is part of the Harvard Library Bibliographic Dataset, which is provided by the Harvard Library under its Bibliographic Dataset Use Terms and includes data made available by, among others, OCLC Online Computer Library Center, Inc. and the Library of Congress.
Accession Number:
edshlc.013923459.4
Database:
Harvard Library Bibliographic Dataset
Weitere Informationen
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.