大葉大學圖書館 |

Algorithms and discrete applied mathematics[electronic resource] :second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016 : proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	004.0151
書名/作者:	Algorithms and discrete applied mathematics : second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016 : proceedings // edited by Sathish Govindarajan, Anil Maheshwari.
其他題名:	CALDAM 2016
其他作者:	Govindarajan, Sathish.
團體作者:	Clark Conference
出版者:	Cham : : Springer International Publishing :, 2016.
面頁冊數:	xiii, 369 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Computer science - Periodicals. - Mathematics
標題:	Algorithms
標題:	Computer Science.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Data Structures.
標題:	Discrete Mathematics in Computer Science.
標題:	Numeric Computing.
標題:	Computer Graphics.
標題:	Algorithms.
ISBN:	9783319292212
ISBN:	9783319292205
內容註:	Algorithms for Problems on Maximum Density Segment -- Distance spectral radius of k-partitioned transmission regular graphs -- Color Spanning Objects: Algorithms and Hardness Results -- On Hamiltonian colorings of trees -- On the Complexity Landscape of the Domination Chain -- On the probability of being synchronizable -- Linear-Time Fitting of a k-Step Function -- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications -- Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions -- Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints -- Lower Bounds on the Dilation of Plane Spanners -- Lattice Spanners of Low Degree -- AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables -- Approximation Algorithms for Cumulative VRP with Stochastic Demands -- Some Distance Antimagic Labelled Graphs -- A New Construction of Broadcast Graphs -- Improved Algorithm for Maximum Independent Set on Unit Disk Graph -- Independent Sets in Classes Related to Chair-free Graphs -- Cyclic Codes over Galois Rings -- On The Center Sets of Some Graph Classes -- On Irreducible No-hole L(2,1)-labelings of Hypercubes and Triangular Lattices -- Medians of permutations : building constraints -- b-Disjunctive total domination in graphs: Algorithm and hardness results -- m-Gracefulness of Graphs -- Domination Parameters in Hypertree -- Complexity of Steiner Tree in Split Graphs - Dichotomy Results -- Relative clique number of planar signed graphs -- The cd-coloring of graphs -- Characterization of H-graphs -- On the Power Domination Number of Graph Products.
摘要、提要註:	This book collects the refereed proceedings of the Second International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016. The volume contains 30 full revised papers from 90 submissions along with 1 invited talk presented at the conference. The conference focuses on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental) and the mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.
電子資源:	http://dx.doi.org/10.1007/978-3-319-29221-2

Algorithms and discrete applied mathematics[electronic resource] :second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016 : proceedings /
Algorithms and discrete applied mathematicssecond International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016 : proceedings /[electronic resource] :CALDAM 2016edited by Sathish Govindarajan, Anil Maheshwari. - Cham :Springer International Publishing :2016. - xiii, 369 p. :ill., digital ;24 cm. - Lecture notes in computer science,96020302-9743 ;. - Lecture notes in computer science ;7103..

Algorithms for Problems on Maximum Density Segment -- Distance spectral radius of k-partitioned transmission regular graphs -- Color Spanning Objects: Algorithms and Hardness Results -- On Hamiltonian colorings of trees -- On the Complexity Landscape of the Domination Chain -- On the probability of being synchronizable -- Linear-Time Fitting of a k-Step Function -- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications -- Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions -- Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints -- Lower Bounds on the Dilation of Plane Spanners -- Lattice Spanners of Low Degree -- AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables -- Approximation Algorithms for Cumulative VRP with Stochastic Demands -- Some Distance Antimagic Labelled Graphs -- A New Construction of Broadcast Graphs -- Improved Algorithm for Maximum Independent Set on Unit Disk Graph -- Independent Sets in Classes Related to Chair-free Graphs -- Cyclic Codes over Galois Rings -- On The Center Sets of Some Graph Classes -- On Irreducible No-hole L(2,1)-labelings of Hypercubes and Triangular Lattices -- Medians of permutations : building constraints -- b-Disjunctive total domination in graphs: Algorithm and hardness results -- m-Gracefulness of Graphs -- Domination Parameters in Hypertree -- Complexity of Steiner Tree in Split Graphs - Dichotomy Results -- Relative clique number of planar signed graphs -- The cd-coloring of graphs -- Characterization of H-graphs -- On the Power Domination Number of Graph Products.

This book collects the refereed proceedings of the Second International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016. The volume contains 30 full revised papers from 90 submissions along with 1 invited talk presented at the conference. The conference focuses on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental) and the mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.

ISBN: 9783319292212

Standard No.: 10.1007/978-3-319-29221-2doiSubjects--Topical Terms:

345167
Computer science
--Mathematics--Periodicals.

LC Class. No.: QA76.9.M35 / C35 2016

Dewey Class. No.: 004.0151

Algorithms and discrete applied mathematics[electronic resource] :second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016 : proceedings /
LDR:03499nam a2200337 a 4500 001 446531
003 DE-He213
005 20160910160358.0
006 m d
007 cr nn 008maaau
008 161201s2016 gw s 0 eng d
020 $a 9783319292212 $q (electronic bk.)
020 $a 9783319292205 $q (paper)
024 7 $a 10.1007/978-3-319-29221-2 $2 doi
035 $a 978-3-319-29221-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35 $b C35 2016
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b C145 2016
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
245 1 0 $a Algorithms and discrete applied mathematics $h [electronic resource] : $b second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016 : proceedings / $c edited by Sathish Govindarajan, Anil Maheshwari.
246 3 $a CALDAM 2016
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xiii, 369 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9602
505 0 $a Algorithms for Problems on Maximum Density Segment -- Distance spectral radius of k-partitioned transmission regular graphs -- Color Spanning Objects: Algorithms and Hardness Results -- On Hamiltonian colorings of trees -- On the Complexity Landscape of the Domination Chain -- On the probability of being synchronizable -- Linear-Time Fitting of a k-Step Function -- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications -- Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions -- Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints -- Lower Bounds on the Dilation of Plane Spanners -- Lattice Spanners of Low Degree -- AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables -- Approximation Algorithms for Cumulative VRP with Stochastic Demands -- Some Distance Antimagic Labelled Graphs -- A New Construction of Broadcast Graphs -- Improved Algorithm for Maximum Independent Set on Unit Disk Graph -- Independent Sets in Classes Related to Chair-free Graphs -- Cyclic Codes over Galois Rings -- On The Center Sets of Some Graph Classes -- On Irreducible No-hole L(2,1)-labelings of Hypercubes and Triangular Lattices -- Medians of permutations : building constraints -- b-Disjunctive total domination in graphs: Algorithm and hardness results -- m-Gracefulness of Graphs -- Domination Parameters in Hypertree -- Complexity of Steiner Tree in Split Graphs - Dichotomy Results -- Relative clique number of planar signed graphs -- The cd-coloring of graphs -- Characterization of H-graphs -- On the Power Domination Number of Graph Products.
520 $a This book collects the refereed proceedings of the Second International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016. The volume contains 30 full revised papers from 90 submissions along with 1 invited talk presented at the conference. The conference focuses on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental) and the mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.
650 0 $a Computer science $x Mathematics $v Periodicals. $3 345167
650 0 $a Algorithms $3 135237
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Data Structures. $3 467911
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Numeric Computing. $3 466954
650 2 4 $a Computer Graphics. $3 464677
650 2 4 $a Algorithms. $3 182797
700 1 $a Govindarajan, Sathish. $3 639246
700 1 $a Maheshwari, Anil. $3 639247
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-29221-2
950 $a Computer Science (Springer-11645)