Algorithms and Discrete Applied Mathematics
Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings
(Sprache: Englisch)
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...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
54.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Algorithms and Discrete Applied Mathematics “
Klappentext zu „Algorithms and Discrete Applied Mathematics “
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.
Inhaltsverzeichnis zu „Algorithms and Discrete Applied Mathematics “
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.
Bibliographische Angaben
- 2016, 1st ed. 2016, XIII, 369 Seiten, 369 farbige Abbildungen, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Herausgegeben: Sathish Govindarajan, Anil Maheshwari
- Verlag: Springer, Berlin
- ISBN-10: 331929220X
- ISBN-13: 9783319292205
- Erscheinungsdatum: 14.02.2016
Sprache:
Englisch
Kommentar zu "Algorithms and Discrete Applied Mathematics"
Schreiben Sie einen Kommentar zu "Algorithms and Discrete Applied Mathematics".
Kommentar verfassen