1 option
Algorithms and Discrete Applied Mathematics : Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings / edited by Daya Gaur, N.S. Narayanaswamy.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 10156
- Theoretical Computer Science and General Issues, 2512-2029 ; 10156
- Language:
- English
- Subjects (All):
- Algorithms.
- Artificial intelligence-Data processing.
- Computer science-Mathematics.
- Discrete mathematics.
- Numerical analysis.
- Computer graphics.
- Data Science.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Computer Graphics.
- Local Subjects:
- Algorithms.
- Data Science.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Computer Graphics.
- Physical Description:
- 1 online resource (XIX, 372 pages) : 72 illustrations
- Edition:
- 1st ed. 2017.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2017.
- System Details:
- text file PDF
- Summary:
- 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. .
- Contents:
- Optimal embedding of locally twisted cubes into grids
- Polynomial Time Algorithms for Bichromatic Problems
- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
- Optimum Gathering of Asynchronous Robots
- Improved bounds for poset sorting in the forbidden-comparison regime
- Positional Dominance: Concepts and Algorithms
- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams
- Querying Relational Event Graphs using Colored Range Searching Data Structures
- Axiomatic Characterization of the Interval Function of a Bipartite Graph
- Analysis of 2-Opt Heuristic for the Winner Determination Problem under the Chamberlin-Courant System
- On Structural Parameterizations of Graph Motif and Chromatic Number
- On chromatic number of colored mixed graphs
- Optimizing movement in a convex path-network to establish connectivity
- On colouring point visibility graphs
- Decomposing semi-complete multigraphs and directed graphs into paths of length two
- On Rank and MDR Cyclic codes of length 2k over Z8
- Group Distance Magic Labeling of Crn
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
- Incremental algorithms to update visibility polygons
- Liar's Domination in 2D
- Structured Instances of Restricted Assignment with Two Processing Times
- Elusiveness of finding degrees
- Maximum weighted independent sets with a budget
- Demand hitting and covering of intervals
- Exact And Parameterized Algorithms For (k; i)-coloring
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete. - Induced matching in some subclasses of bipartite graphs
- Hamiltonicity in Split Graphs - a dichotomy
- Finding Large Independent Sets in Line of Sight Networks
- A lower bound of the cd-chromatic number and its complexity
- Stability number and k-Hamiltonian [a,b]-factors
- Subgraphs with orthogonal [0; ki]n1-factorizations in graphs.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-53007-9
- 9783319530079
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.