Algorithms and Discrete Applied Mathematics 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023, Proceedings /
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. Th...
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Lenguaje: | inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2023.
|
| Edición: | 1st ed. 2023. |
| Colección: | Lecture Notes in Computer Science,
13947 |
| Materias: | |
| Acceso en línea: | https://doi.org/10.1007/978-3-031-25211-2 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-25211-2 | ||
| 003 | DE-He213 | ||
| 005 | 20251225203512.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 230112s2023 sz | s |||| 0|eng d | ||
| 020 | |a 9783031252112 |9 978-3-031-25211-2 | ||
| 024 | 7 | |a 10.1007/978-3-031-25211-2 |2 doi | |
| 050 | 4 | |a QA76.9.M35 | |
| 072 | 7 | |a UYAM |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYAM |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 245 | 1 | 0 | |a Algorithms and Discrete Applied Mathematics |h [electronic resource] : |b 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023, Proceedings / |c edited by Amitabha Bagchi, Rahul Muthu. |
| 250 | |a 1st ed. 2023. | ||
| 264 | 1 | |a Cham : |b Springer International Publishing : |b Imprint: Springer, |c 2023. | |
| 300 | |a XVII, 462 p. 91 illus., 29 illus. in color. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 13947 | |
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Image processing |x Digital techniques. | |
| 650 | 0 | |a Computer vision. | |
| 650 | 0 | |a Data structures (Computer science). | |
| 650 | 0 | |a Information theory. | |
| 650 | 1 | 4 | |a Mathematics of Computing. |
| 650 | 2 | 4 | |a Design and Analysis of Algorithms. |
| 650 | 2 | 4 | |a Computer Imaging, Vision, Pattern Recognition and Graphics. |
| 650 | 2 | 4 | |a Data Structures and Information Theory. |
| 700 | 1 | |a Bagchi, Amitabha. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Muthu, Rahul. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031252105 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031252129 |
| 830 | 0 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 13947 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-25211-2 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-SXPS | ||
| 912 | |a ZDB-2-LNC | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||
| 950 | |a Springer Nature Proceedings Computer Science (SpringerNature-85344) | ||