Cargando…

Algorithms and Discrete Applied Mathematics Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings /

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 t...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Govindarajan, Sathish (Editor ), Maheshwari, Anil (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edición:1st ed. 2016.
Colección:Theoretical Computer Science and General Issues, 9602
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-29221-2
003 DE-He213
005 20230223134336.0
007 cr nn 008mamaa
008 160330s2016 sz | s |||| 0|eng d
020 |a 9783319292212  |9 978-3-319-29221-2 
024 7 |a 10.1007/978-3-319-29221-2  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
245 1 0 |a Algorithms and Discrete Applied Mathematics  |h [electronic resource] :  |b Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings /  |c edited by Sathish Govindarajan, Anil Maheshwari. 
250 |a 1st ed. 2016. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a XIII, 369 p. 76 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9602 
505 0 |a 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. 
520 |a 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. 
650 0 |a Algorithms. 
650 0 |a Artificial intelligence-Data processing. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Numerical analysis. 
650 0 |a Computer graphics. 
650 1 4 |a Algorithms. 
650 2 4 |a Data Science. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Computer Graphics. 
700 1 |a Govindarajan, Sathish.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Maheshwari, Anil.  |e editor.  |0 (orcid)0000-0001-6171-0987  |1 https://orcid.org/0000-0001-6171-0987  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319292205 
776 0 8 |i Printed edition:  |z 9783319292229 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9602 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-29221-2  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)