Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Discrete Applied Mathematics: Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings de Sathish Govindarajan

Algorithms and Discrete Applied Mathematics: Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9602

Editat de Sathish Govindarajan, Anil Maheshwari
en Limba Engleză Paperback – 14 feb 2016
This book collects the refereed proceedingsof the Second International Conference on Algorithms and Discrete AppliedMathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016.The volume contains 30 full revised papers from 90 submissions along with 1invited talk presented at the conference. The conference focuses on topicsrelated to efficient algorithms and data structures, their analysis (boththeoretical and experimental) and the mathematical problems arising thereof,and new applications of discrete mathematics, advances in existing applicationsand development of new tools for discrete mathematics.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31901 lei

Preț vechi: 39876 lei
-20% Nou

Puncte Express: 479
Preț estimativ în valută:
6106€ • 6566$ • 5091£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319292205
ISBN-10: 331929220X
Pagini: 369
Ilustrații: XIII, 369 p. 76 illus. in color.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Algorithmsfor Problems on Maximum Density Segment.- Distance spectral radius ofk-partitioned transmission regular graphs.- Color Spanning Objects: Algorithmsand Hardness Results.- On Hamiltonian colorings of trees.- On the ComplexityLandscape of the Domination Chain.- On the probability of being synchronizable.-Linear-Time Fitting of a k-Step Function.- Random-bit optimal uniform samplingfor rooted planar trees with given sequence of degrees and Applications.- AxiomaticCharacterization of Claw and Paw-free Graphs Using Graph Transit Functions.- Lineartime algorithms for Euclidean 1-center in higher dimensions with non-linearconvex constraints.- Lower Bounds on the Dilation of Plane Spanners.- LatticeSpanners of Low Degree.- AND-Decomposition of Boolean Polynomials withPrescribed Shared Variables.- Approximation Algorithms for Cumulative VRP withStochastic Demands.- Some Distance Antimagic Labelled Graphs.- A NewConstruction of Broadcast Graphs.- Improved Algorithm for Maximum IndependentSet on Unit Disk Graph.- Independent Sets in Classes Related to Chair-freeGraphs.- Cyclic Codes over Galois Rings.- On The Center Sets of Some GraphClasses.- On Irreducible No-hole L(2,1)-labelings of Hypercubes and Triangular Lattices.-Medians of permutations : building constraints.- b-Disjunctive total dominationin graphs: Algorithm and hardness results.- m-Gracefulness of Graphs.- DominationParameters in Hypertree.- Complexity of Steiner Tree in Split Graphs -Dichotomy Results.- Relative clique number of planar signed graphs.- Thecd-coloring of graphs.- Characterization of H-graphs.- On the Power DominationNumber of Graph Products.

Caracteristici

Includes supplementary material: sn.pub/extras