東華大學圖書館 |

Algorithms and discrete applied mathematics = 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and discrete applied mathematics/ edited by Amitabha Bagchi, Rahul Muthu.
其他題名:	9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023 : proceedings /
其他題名:	CALDAM 2023
其他作者:	Bagchi, Amitabha.
團體作者:	CALDAM (Conference)
出版者:	Cham :Springer International Publishing : : 2023.,
面頁冊數:	xvii, 462 p. :ill., digital ;24 cm.
內容註:	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 Knö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.
Contained By:	Springer Nature eBook
標題:	Computer algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-25211-2
ISBN:	9783031252112

Algorithms and discrete applied mathematics = 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023 : proceedings /
Algorithms and discrete applied mathematics9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023 : proceedings /[electronic resource] :CALDAM 2023edited by Amitabha Bagchi, Rahul Muthu. - Cham :Springer International Publishing :2023. - xvii, 462 p. :ill., digital ;24 cm. - Lecture notes in computer science,139471611-3349 ;. - Lecture notes in computer science ;13947..

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 Knö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.

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.

ISBN: 9783031252112

Standard No.: 10.1007/978-3-031-25211-2doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and discrete applied mathematics = 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023 : proceedings /
LDR:04013nmm a2200349 a 4500 001 2315662
003 DE-He213
005 20230112172022.0
006 m d
007 cr nn 008maaau
008 230902s2023 sz s 0 eng d
020 $a 9783031252112 $q (electronic bk.)
020 $a 9783031252105 $q (paper)
024 7 $a 10.1007/978-3-031-25211-2 $2 doi
035 $a 978-3-031-25211-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b C145 2023
111 2 $a CALDAM (Conference) $n (9th : $d 2023 : $c Gndhnagar, India) $3 3628195
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.
246 3 $a CALDAM 2023
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2023.
300 $a xvii, 462 p. : $b ill., digital ; $c 24 cm.
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 Knö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 algorithms $x Congresses. $3 576357
650 0 $a Computer science $x Mathematics $x Congresses. $3 678603
650 1 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 890871
650 2 4 $a Data Structures and Information Theory. $3 3382368
700 1 $a Bagchi, Amitabha. $3 3526675
700 1 $a Muthu, Rahul. $3 3628196
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13947. $3 3628197
856 4 0 $u https://doi.org/10.1007/978-3-031-25211-2
950 $a Computer Science (SpringerNature-11645)