Muutke küpsiste eelistusi

E-raamat: Algorithms and Discrete Applied Mathematics: 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 80,26 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Algorithms and Discrete Applied Mathematics: 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022.





The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.
A proof of the Multiplicative 1-2-3 Conjecture.- The geodesic
transversal problem on some networks.- Chromatic Bounds for Some Subclasses
of $(P_3\cup P_2)$-free Graphs.- List homomorphisms to separable signed
graphs.- Some position problems for graphs.- Comparability graphs among
Cover-Incomparability graphs.- Complexity of Paired Domination in AT-free and
Planar Graphs.- The Complexity of Star Colouring in Bounded Degree Graphs and
Regular Graphs.- On Conflict-Free Spanning Tree: Algorithms and Complexity.-
B0-VPG Representation of AT-free Outerplanar Graphs.- P versus NPC : Steiner
tree in convex split graphs.- On cd-coloring of {P_5,K_4}-free chordal
graphs.- An output-sensitive algorithm for all-pairs shortest paths in
directed acyclic graphs.- Covering a Graph with Densest Subgraphs.- Coresets
for $(k, \ell)$-Median Clustering under the Fréchet Distance.- Bounds and
Algorithms for Geodetic Hulls.- Voronoi Games using Geodesics.- Approximation
and parameterized algorithms for balanced connected partition problems.-
Algorithms for Online Car-sharing Problem.- Algebraic algorithms for variants
of Subset Sum.- Hardness and Approximation Results for Some Variants of
Stable Marriage Problem.- On Fair Division with Binary Valuations Respecting
Social Networks.- Parameterized Intractability of  Defensive  Alliance
Problem.- On the approximability of path and cycle problems in arc-dependent
networks}.- Approximation Algorithms in Graphs with Known Broadcast time of
the Base Graph.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830309501876e.html
Märksõnad: