Algorithms and Discrete Applied Mathematics : Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings / edited by Sathish Govindarajan, Anil Maheshwari.

Format:

Book

Contributor:

Govindarajan, Sathish, 1976- editor.

Maheshwari, Anil, 1965- editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9602.

Theoretical Computer Science and General Issues ; 9602

Language:

English

Subjects (All):

Algorithms.

Data structures (Computer science).

Computer science--Mathematics.

Computer science.

Numerical analysis.

Computer graphics.

Algorithm Analysis and Problem Complexity.

Data Structures.

Discrete Mathematics in Computer Science.

Numeric Computing.

Computer Graphics.

Local Subjects:

Algorithm Analysis and Problem Complexity.

Data Structures.

Discrete Mathematics in Computer Science.

Numeric Computing.

Computer Graphics.

Algorithms.

Physical Description:

1 online resource (XIII, 369 pages) : 76 illustrations in color.

Edition:

First edition 2016.

Contained In:

Springer eBooks

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2016.

System Details:

text file PDF

Summary:

This book collects the refereed proceedings of the Second International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016. The volume contains 30 full revised papers from 90 submissions along with 1 invited talk presented at the conference. The conference focuses on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental) and the mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.

Contents:

Algorithms for Problems on Maximum Density Segment

Distance spectral radius of k-partitioned transmission regular graphs

Color Spanning Objects: Algorithms and Hardness Results

On Hamiltonian colorings of trees

On the Complexity Landscape of the Domination Chain

On the probability of being synchronizable

Linear-Time Fitting of a k-Step Function

Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications

Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions

Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints

Lower Bounds on the Dilation of Plane Spanners

Lattice Spanners of Low Degree

AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables

Approximation Algorithms for Cumulative VRP with Stochastic Demands

Some Distance Antimagic Labelled Graphs

A New Construction of Broadcast Graphs

Improved Algorithm for Maximum Independent Set on Unit Disk Graph

Independent Sets in Classes Related to Chair-free Graphs

Cyclic Codes over Galois Rings

On The Center Sets of Some Graph Classes

On Irreducible No-hole L(2,1)-labelings of Hypercubes and Triangular Lattices

Medians of permutations : building constraints

b-Disjunctive total domination in graphs: Algorithm and hardness results

m-Gracefulness of Graphs

Domination Parameters in Hypertree

Complexity of Steiner Tree in Split Graphs - Dichotomy Results

Relative clique number of planar signed graphs

The cd-coloring of graphs

Characterization of H-graphs

On the Power Domination Number of Graph Products.

Other Format:

Printed edition:

ISBN:

978-3-319-29221-2

9783319292212

Access Restriction:

Restricted for use by site license.