このページのリンク

Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings / edited by Niranjan Balachandran, R. Inkulu
(Theoretical Computer Science and General Issues. ISSN:25122029 ; 13179)

データ種別 電子ブック
1st ed. 2022.
出版者 (Cham : Springer International Publishing : Imprint: Springer)
出版年 2022
大きさ XIX, 317 p. 55 illus : online resource
著者標目 Balachandran, Niranjan editor
Inkulu, R editor
SpringerLink (Online service)

所蔵情報を非表示

URL
射水-電子 007 EB0002858 Computer Scinece R0 2005-6,2022-3

9783030950187

書誌詳細を非表示

一般注記 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
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
HTTP:URL=https://doi.org/10.1007/978-3-030-95018-7
件 名 LCSH:Computer science -- Mathematics  全ての件名で検索
LCSH:Algorithms
LCSH:Data structures (Computer science)
LCSH:Information theory
LCSH:Discrete mathematics
FREE:Mathematics of Computing
FREE:Algorithms
FREE:Data Structures and Information Theory
FREE:Discrete Mathematics in Computer Science
分 類 LCC:QA76.9.M35
DC23:004.0151
書誌ID EB00002246
ISBN 9783030950187

 類似資料