Algorithms and Discrete Applied Mathematics: 10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings

Author:   Subrahmanyam Kalyanasundaram ,  Anil Maheshwari
Publisher:   Springer International Publishing AG
Edition:   1st ed. 2024
Volume:   14508
ISBN:  

9783031522123


Pages:   330
Publication Date:   26 January 2024
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $197.97 Quantity:  
Add to Cart

Share |

Algorithms and Discrete Applied Mathematics: 10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings


Add your own review!

Overview

Full Product Details

Author:   Subrahmanyam Kalyanasundaram ,  Anil Maheshwari
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2024
Volume:   14508
Weight:   0.539kg
ISBN:  

9783031522123


ISBN 10:   3031522125
Pages:   330
Publication Date:   26 January 2024
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

​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 Vertex Cover 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

wl

Shopping Cart
Your cart is empty
Shopping cart
Mailing List