Del 9602 i serien Lecture Notes in Computer Science

Algorithms and Discrete Applied Mathematics

Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings

Häftad, Engelska, 2016

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book collects the refereed proceedingsof the Second International Conference on Algorithms and Discrete AppliedMathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016.

Produktinformation

Utgivningsdatum2016-02-14
Mått155 x 235 x 21 mm
Vikt581 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor369
FörlagSpringer International Publishing AG
ISBN9783319292205

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och IT

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.