1 option
Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings / edited by Niranjan Balachandran, R. Inkulu.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 13179
- Theoretical Computer Science and General Issues, 2512-2029 ; 13179
- Language:
- English
- Subjects (All):
- Computer science-Mathematics.
- Algorithms.
- Data structures (Computer science).
- Information theory.
- Discrete mathematics.
- Mathematics of Computing.
- Data Structures and Information Theory.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Mathematics of Computing.
- Algorithms.
- Data Structures and Information Theory.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XIX, 317 pages) : 55 illustrations
- Edition:
- 1st ed. 2022.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2022.
- System Details:
- text file PDF
- Summary:
- This book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022. The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.
- Contents:
- A proof of the Multiplicative 1-2-3 Conjecture
- The geodesic transversal problem on some networks
- Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free Graphs
- List homomorphisms to separable signed graphs
- Some position problems for graphs
- Comparability graphs among Cover-Incomparability graphs
- Complexity of Paired Domination in AT-free and Planar Graphs
- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs
- On Conflict-Free Spanning Tree: Algorithms and Complexity
- B0-VPG Representation of AT-free Outerplanar Graphs
- P versus NPC : Steiner tree in convex split graphs
- On cd-coloring of {P_5,K_4}-free chordal graphs
- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs
- Covering a Graph with Densest Subgraphs
- Coresets for $(k, \ell)$-Median Clustering under the Fréchet Distance
- Bounds and Algorithms for Geodetic Hulls
- Voronoi Games using Geodesics
- Approximation and parameterized algorithms for balanced connected partition problems
- Algorithms for Online Car-sharing Problem
- Algebraic algorithms for variants of Subset Sum
- Hardness and Approximation Results for Some Variants of Stable Marriage Problem
- On Fair Division with Binary Valuations Respecting Social Networks
- Parameterized Intractability of Defensive Alliance Problem
- On the approximability of path and cycle problems in arc-dependent networks}
- Approximation Algorithms in Graphs with Known Broadcast time of the Base Graph.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-95018-7
- 9783030950187
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.