000 | 05254nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-031-25211-2 | ||
003 | DE-He213 | ||
005 | 20240730175513.0 | ||
007 | cr nn 008mamaa | ||
008 | 230112s2023 sz | s |||| 0|eng d | ||
020 |
_a9783031252112 _9978-3-031-25211-2 |
||
024 | 7 |
_a10.1007/978-3-031-25211-2 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAlgorithms and Discrete Applied Mathematics _h[electronic resource] : _b9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings / _cedited by Amitabha Bagchi, Rahul Muthu. |
250 | _a1st ed. 2023. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2023. |
|
300 |
_aXVII, 462 p. 91 illus., 29 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13947 |
|
505 | 0 | _aStable 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 | _aThis 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 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aImage processing _xDigital techniques. _94145 |
|
650 | 0 |
_aComputer vision. _9116940 |
|
650 | 0 |
_aData structures (Computer science). _98188 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 1 | 4 |
_aMathematics of Computing. _931875 |
650 | 2 | 4 |
_aDesign and Analysis of Algorithms. _931835 |
650 | 2 | 4 |
_aComputer Imaging, Vision, Pattern Recognition and Graphics. _931569 |
650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
700 | 1 |
_aBagchi, Amitabha. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9116941 |
|
700 | 1 |
_aMuthu, Rahul. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9116942 |
|
710 | 2 |
_aSpringerLink (Online service) _9116943 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031252105 |
776 | 0 | 8 |
_iPrinted edition: _z9783031252129 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13947 _923263 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-25211-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c89955 _d89955 |