Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Algorithms and Discrete Applied Mathematics -

Algorithms and Discrete Applied Mathematics

10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings
Buch | Softcover
XXI, 330 Seiten
2024 | 1st ed. 2024
Springer International Publishing (Verlag)
978-3-031-52212-3 (ISBN)
CHF 98,85 inkl. MwSt
  • Versand in 15-20 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken

This book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15-17, 2024.

The 22 full papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry; Discrete Applied Mathematics; Graph Algorithms; Graph Theory.

Algorithms and Complexity.- Consecutive Occurrences with Distance Constraints.- Parameterized Aspects of Distinct Kemeny Rank Aggregation.- Monitoring Edge-geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.- Distance-2-Dispersion with Termination by a Strong Team.- On Query Complexity Measures and their Relations for Symmetric Functions.- Computational Geometry.- Growth Rate of the Number of Empty Triangles in the Plane.- Geometric Covering Number: Covering Points with Curves.- Improved Algorithms for Minimum-Membership Geometric Set Cover.- Semi-total Domination in Unit Disk Graphs.- Discrete Applied Mathematics.- An Efficient Interior Point Method for Linear Optimization using Modified Newton Method.- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs.- The Frobenius Problem for the Proth Numbers.- Graph Algorithms.- Eternal Connected VertexCover Problem in Graphs: Complexity and Algorithms.- Impact of Diameter and Convex Ordering for Hamiltonicity and Domination.- On Star Partition of Split Graphs.- Star Covers and Star Partitions of Cographs and Butterfly-free Graphs.- Open Packing in H-free Graphs and Subclasses of Split Graphs.- Graph Theory.- Location-domination Type Problems Under the Mycielski Construction.- On Total Chromatic Number of Complete Multipartite Graphs.- The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability.- Total Coloring of Some Graph Operations.- Star Colouring of Regular Graphs Meets Weaving and Line Graphs.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XXI, 330 p. 69 illus., 20 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 539 g
Themenwelt Informatik Grafik / Design Digitale Bildverarbeitung
Mathematik / Informatik Informatik Theorie / Studium
Schlagworte approximation algorithms • Approximation Theory • Artificial Intelligence • Bipartite Graphs • Coloring • Computer Networks
ISBN-10 3-031-52212-5 / 3031522125
ISBN-13 978-3-031-52212-3 / 9783031522123
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Modelle für 3D-Druck und CNC entwerfen

von Lydia Sloan Cline

Buch | Softcover (2022)
dpunkt (Verlag)
CHF 48,85
Entwicklung von immersiver Software

von Manfred Brill

Buch | Softcover (2023)
Springer Vieweg (Verlag)
CHF 27,95