國立虎尾科技大學 |

Algorithms and Discrete Applied Mathematics = 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Algorithms and Discrete Applied Mathematics/ edited by Niranjan Balachandran, R. Inkulu.
Reminder of title:	8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings /
other author:	Balachandran, Niranjan.
Description:	XIX, 317 p. 55 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-030-95018-7
ISBN:	9783030950187

Algorithms and Discrete Applied Mathematics = 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings /
Algorithms and Discrete Applied Mathematics8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings /[electronic resource] :edited by Niranjan Balachandran, R. Inkulu. - 1st ed. 2022. - XIX, 317 p. 55 illus.online resource. - Theoretical Computer Science and General Issues,131792512-2029 ;. - Theoretical Computer Science and General Issues,12865.

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.

ISBN: 9783030950187

Standard No.: 10.1007/978-3-030-95018-7doiSubjects--Topical Terms:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Algorithms and Discrete Applied Mathematics = 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings /
LDR:03465nam a22004095i 4500 001 1093314
003 DE-He213
005 20220223204419.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783030950187 $9 978-3-030-95018-7
024 7 $a 10.1007/978-3-030-95018-7 $2 doi
035 $a 978-3-030-95018-7
050 4 $a QA76.9.M35
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $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 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings / $c edited by Niranjan Balachandran, R. Inkulu.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIX, 317 p. 55 illus. $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 Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 13179
505 0 $a 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.
520 $a 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.
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Information theory. $3 595305
650 0 $a Discrete mathematics. $3 1254302
650 1 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
700 1 $a Balachandran, Niranjan. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1401249
700 1 $a Inkulu, R. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1401250
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030950170
776 0 8 $i Printed edition: $z 9783030950194
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-95018-7
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)