
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.
This book presents cutting-edge research in algorithms and computation from the 7th International Workshop on Algorithms and Computation (WALCOM 2013). It features 29 carefully selected papers covering a broad spectrum of topics within theoretical computer science. The research presented addresses complex problems in areas such as computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity theory, and graph drawing, offering insights into the latest advancements and challenges in the field.
The papers in this volume represent a rigorous selection from numerous submissions, indicating a high standard of quality and relevance within the academic community. The focus on established areas like computational geometry and graph algorithms, alongside emerging topics in distributed computing and complexity, suggests a comprehensive overview of current research trends. The collection is likely to be of significant interest to researchers and advanced students in theoretical computer science seeking to engage with the latest developments in algorithmic design and analysis.
Page Count:
348
Publication Date:
2013-01-01
ISBN-10:
3642360653
ISBN-13:
9783642360657
No comments yet. Be the first to share your thoughts!