Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023, Proceedings de Amitabha Bagchi

Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023, Proceedings: Lecture Notes in Computer Science, cartea 13947

Editat de Amitabha Bagchi, Rahul Muthu
en Limba Engleză Paperback – 3 feb 2023
This book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023. The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 53180 lei

Preț vechi: 66476 lei
-20% Nou

Puncte Express: 798
Preț estimativ în valută:
9409€ • 10978$ • 8226£

Carte disponibilă

Livrare economică 26 decembrie 25 - 09 ianuarie 26
Livrare express 12-18 decembrie pentru 4139 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031252105
ISBN-10: 3031252101
Pagini: 462
Ilustrații: XVII, 462 p. 91 illus., 29 illus. in color.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.67 kg
Ediția:1st ed. 2023
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Stable Approximation Schemes.- A whirlwind tour of intersection graph enumeration.- Graph modification problems with forbidden minors.- Algorithms & Optimization Efficient reductions and algorithms for Subset Product.- Optimal length cutting plane refutations of integer programs.- Fault-Tolerant Dispersion Resource management in device-to-device communications.- Computational Geometry Algorithms for k-Dispersion for Points in Convex Position in the Plane.- Arbitrary oriented color spanning region for line segments.- Games with a Simple Rectilinear Obstacle in Plane.- Diverse Fair Allocations: Complexity and Algorithms.- Graph Coloring New bounds and constructions for neighbor-locating colorings of graphs.- D K 5-list coloring toroidal 6-regular triangulations in linear time.- On Locally Identifying Coloring of Graphs.- On Structural Parameterizations of Star Coloring.- Reddy Perfectness of G-generalized join of graphs.- Coloring of a superclass of 2K2-free graphs.- The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures.- Graph Connectivity Short cycles dictate dichotomy status of the Steiner tree problem on Bisplit graphs.- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs.- Monitoring edge-geodetic sets in graphs.- Cyclability, Connectivity and Circumference.- Graph Domination On three domination-based identification problems in block graphs.- Graph modification problems with forbidden minors.- Computational Aspects of Double Dominating Sequences in Graph.- Relation between broadcast domination and multipacking numbers on chordal graphs.- Pushing Cops and Robber on Oriented Graphs.- Mind the Gap: Edge Facility Location Problems in Theory and Practice.- Complexity Results on Cosecure Domination in Graphs.- Kusum and Arti Pandey Graph Matching Latin Hexahedra and Related Combinatorial Structures.- Minimum Maximal Acyclic Matching in Proper Interval Graphs.- Graph Partition & Graph Covering Transitivity on subclasses of chordal graphs.- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength.- Covering using Bounded Size Subgraphs.- Axiomatic characterization of the the toll walk function of some graph classes.- Structural Parameterization of Alliance Problems.