東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Algorithms and discrete applied mathematics = 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and discrete applied mathematics/ edited by Subrahmanyam Kalyanasundaram, Anil Maheshwari.
其他題名:	10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024 : proceedings /
其他題名:	CALDAM 2024
其他作者:	Kalyanasundaram, Subrahmanyam.
團體作者:	CALDAM (Conference)
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	xxi, 330 p. :ill. (some col.), digital ;24 cm.
內容註:	Algorithms and Complexity -- Consecutive Occurrences with Distance Constraints -- Parameterized Aspects of Distinct Kemeny Rank Aggregation -- Monitoring Edge-geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity -- Distance-2-Dispersion with Termination by a Strong Team -- On Query Complexity Measures and their Relations for Symmetric Functions -- Computational Geometry -- Growth Rate of the Number of Empty Triangles in the Plane -- Geometric Covering Number: Covering Points with Curves -- Improved Algorithms for Minimum-Membership Geometric Set Cover -- Semi-total Domination in Unit Disk Graphs -- Discrete Applied Mathematics -- An Efficient Interior Point Method for Linear Optimization using Modified Newton Method -- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs -- The Frobenius Problem for the Proth Numbers -- Graph Algorithms -- Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms -- Impact of Diameter and Convex Ordering for Hamiltonicity and Domination -- On Star Partition of Split Graphs -- Star Covers and Star Partitions of Cographs and Butterfly-free Graphs -- Open Packing in H-free Graphs and Subclasses of Split Graphs -- Graph Theory -- Location-domination Type Problems Under the Mycielski Construction -- On Total Chromatic Number of Complete Multipartite Graphs -- The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability -- Total Coloring of Some Graph Operations -- Star Colouring of Regular Graphs Meets Weaving and Line Graphs.
Contained By:	Springer Nature eBook
標題:	Computer algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-52213-0
ISBN:	9783031522130

Algorithms and discrete applied mathematics = 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024 : proceedings /
Algorithms and discrete applied mathematics10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024 : proceedings /[electronic resource] :CALDAM 2024edited by Subrahmanyam Kalyanasundaram, Anil Maheshwari. - Cham :Springer Nature Switzerland :2024. - xxi, 330 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,145080302-9743 ;. - Lecture notes in computer science ;14508..

Algorithms and Complexity -- Consecutive Occurrences with Distance Constraints -- Parameterized Aspects of Distinct Kemeny Rank Aggregation -- Monitoring Edge-geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity -- Distance-2-Dispersion with Termination by a Strong Team -- On Query Complexity Measures and their Relations for Symmetric Functions -- Computational Geometry -- Growth Rate of the Number of Empty Triangles in the Plane -- Geometric Covering Number: Covering Points with Curves -- Improved Algorithms for Minimum-Membership Geometric Set Cover -- Semi-total Domination in Unit Disk Graphs -- Discrete Applied Mathematics -- An Efficient Interior Point Method for Linear Optimization using Modified Newton Method -- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs -- The Frobenius Problem for the Proth Numbers -- Graph Algorithms -- Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms -- Impact of Diameter and Convex Ordering for Hamiltonicity and Domination -- On Star Partition of Split Graphs -- Star Covers and Star Partitions of Cographs and Butterfly-free Graphs -- Open Packing in H-free Graphs and Subclasses of Split Graphs -- Graph Theory -- Location-domination Type Problems Under the Mycielski Construction -- On Total Chromatic Number of Complete Multipartite Graphs -- The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability -- Total Coloring of Some Graph Operations -- Star Colouring of Regular Graphs Meets Weaving and Line Graphs.

This book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15-17, 2024. The 22 full papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry; Discrete Applied Mathematics; Graph Algorithms; Graph Theory.

ISBN: 9783031522130

Standard No.: 10.1007/978-3-031-52213-0doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and discrete applied mathematics = 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024 : proceedings /
LDR:03219nmm a2200349 a 4500 001 2368652
003 DE-He213
005 20240113150700.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031522130 $q (electronic bk.)
020 $a 9783031522123 $q (paper)
024 7 $a 10.1007/978-3-031-52213-0 $2 doi
035 $a 978-3-031-52213-0
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 2024
111 2 $a CALDAM (Conference) $n (10th : $d 2024 : $c Bhilai, India) $3 3712708
245 1 0 $a Algorithms and discrete applied mathematics $h [electronic resource] : $b 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024 : proceedings / $c edited by Subrahmanyam Kalyanasundaram, Anil Maheshwari.
246 3 $a CALDAM 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xxi, 330 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14508
505 0 $a Algorithms and Complexity -- Consecutive Occurrences with Distance Constraints -- Parameterized Aspects of Distinct Kemeny Rank Aggregation -- Monitoring Edge-geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity -- Distance-2-Dispersion with Termination by a Strong Team -- On Query Complexity Measures and their Relations for Symmetric Functions -- Computational Geometry -- Growth Rate of the Number of Empty Triangles in the Plane -- Geometric Covering Number: Covering Points with Curves -- Improved Algorithms for Minimum-Membership Geometric Set Cover -- Semi-total Domination in Unit Disk Graphs -- Discrete Applied Mathematics -- An Efficient Interior Point Method for Linear Optimization using Modified Newton Method -- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs -- The Frobenius Problem for the Proth Numbers -- Graph Algorithms -- Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms -- Impact of Diameter and Convex Ordering for Hamiltonicity and Domination -- On Star Partition of Split Graphs -- Star Covers and Star Partitions of Cographs and Butterfly-free Graphs -- Open Packing in H-free Graphs and Subclasses of Split Graphs -- Graph Theory -- Location-domination Type Problems Under the Mycielski Construction -- On Total Chromatic Number of Complete Multipartite Graphs -- The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability -- Total Coloring of Some Graph Operations -- Star Colouring of Regular Graphs Meets Weaving and Line Graphs.
520 $a This book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15-17, 2024. The 22 full papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry; Discrete Applied Mathematics; Graph Algorithms; Graph Theory.
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 Computer Imaging, Vision, Pattern Recognition and Graphics. $3 890871
700 1 $a Kalyanasundaram, Subrahmanyam. $3 3712709
700 1 $a Maheshwari, Anil. $3 2186495
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 14508. $3 3712710
856 4 0 $u https://doi.org/10.1007/978-3-031-52213-0
950 $a Computer Science (SpringerNature-11645)