Muutke küpsiste eelistusi

E-raamat: Algorithms and Discrete Applied Mathematics: 11th International Conference, CALDAM 2025, Coimbatore, India, February 13-15, 2025, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 74,09 €*
  • * 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: 11th International Conference, CALDAM 2025, Coimbatore, India, February 13-15, 2025, 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 refereed proceedings of the 11th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2025, held in Coimbatore, India, during February 1315, 2025.





The 30 full papers included in this book were carefully reviewed and selected from 89 submissions.The conference had papers in algorithms and complexity, discrete applied mathematics, computational geometry, graph theory, graph colouring, graph partition, and domination in graphs.
.- Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and
Feedback Vertex Set.



.- Graceful coloring is computationally hard.



.- Parameterized Complexity of Coupon Coloring of Graphs.



.- Spectra of eccentricity matrices of product of graphs.



.- Almost Empty Monochromatic Polygons in Planar Point Sets.



.- On the parameterized Complexity of Odd Coloring.



.- On full-separating sets in graphs.



.- Polynomial time algorithms for Hop domination.



.- Charging Station Placement for Limited Energy Robots.



.- Multipacking in Euclidean Plane.



.- Partial Domination in Some Geometric Intersection Graphs.



.- Generalized Lettericity of Graphs.



.- Polynomial-time algorithms for PATH COVER on trees and graphs of bounded
treewidth.



.- Fast FPT Algorithms for Grundy Number on Dense Graphs.



.- On a Tight Bound for the Maximum Number of Vertices that Belong to Every
Metric Basis.



.- Algorithms and hardness results for the (3,1)-cover problem.



.- Extension Perfect Roman Domination.



.- A sub-quadratic algorithm for the minsum one sink location problem on
balanced binary tree networks.



.- Two Step Graph Protection Game.



.- Bipartite Domination in Graphs: Complexity and Algorithms.



.- Packing sets of paths, stars and triangles: tractability and
approximability.



.- Structural Parameterization of Minus Domination.



.- An algebraic characterization of strong graphs.



.- There are finitely many uniformly most reliable graphs of corank
5.



.- Helly Number, Radon Number and Rank in $\Delta$-Convexity on Graphs.



.- Forbidden induced subgraphs in iterative higher order line graphs.



.- Total Domination and Open Packing in Two Subclasses of Triangle-free
Graphs.



.- The MASEMPR problem and its applications in logistics.



.- Broadcast Graph Is NP-complete.



.- Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830318343876e.html