Editors:
Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10156)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): CALDAM: Conference on Algorithms and Discrete Applied Mathematics
Conference proceedings info: CALDAM 2017.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (32 papers)
-
Front Matter
About this book
This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017.
The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry.
Keywords
- Computer Science
- clustering
- colored mixed graphs
- comparability
- embedding
- graph algorithm
- minimal degree polynomial
- NP-complete
- optimal set
- sort
- stability number
- streaming algorithms
- subgraph
- topological
- traveling salesman problem
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
University of Lethbridge, Lethbridge, Canada
Daya Gaur
-
Indian Institute of Technology Madras, Chennai, India
N.S. Narayanaswamy
Bibliographic Information
Book Title: Algorithms and Discrete Applied Mathematics
Book Subtitle: Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings
Editors: Daya Gaur, N.S. Narayanaswamy
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-53007-9
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
License: CC BY
Softcover ISBN: 978-3-319-53006-2Published: 03 February 2017
eBook ISBN: 978-3-319-53007-9Published: 24 January 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIX, 372
Number of Illustrations: 72 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Data Structures, Discrete Mathematics in Computer Science, Numeric Computing, Computer Graphics, Algorithms