國立虎尾科技大學 |

Algorithms and Discrete Applied Mathematics = 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms and Discrete Applied Mathematics/ edited by B.S. Panda, Partha P. Goswami.
其他題名:	4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /
其他作者:	Panda, B.S.
面頁冊數:	XVI, 301 p. 58 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-319-74180-2
ISBN:	9783319741802

Algorithms and Discrete Applied Mathematics = 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /
Algorithms and Discrete Applied Mathematics4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /[electronic resource] :edited by B.S. Panda, Partha P. Goswami. - 1st ed. 2018. - XVI, 301 p. 58 illus.online resource. - Theoretical Computer Science and General Issues ;10743. - Theoretical Computer Science and General Issues ;9163.

Efficient Domination and Efficient Edge Domination: A Brief Survey -- Mixed Unit Interval Bigraphs.-Hamiltonian Path in K1,t-free split Graphs – a Dichotomy -- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems -- Probabilistic Properties of Highly Connected Random Geometric Graphs -- On Indicated Coloring of Some Classes of Graphs -- Line Segment Disk Cover -- Fixed-parameter tractable algorithms for Tracking Set Problems -- Exact computation of the number of accepting paths of an NTM -- Determining Minimal Degree Polynomials of a Cyclic Code of length 2^k over Z8 -- Consistent Subset Problem with two labels -- The Edge Geodetic Number of Product Graphs -- Burning Spiders -- Drawing Graphs on Few Circles and Few Spheres -- On a lower bound for the eccentric connectivity index of graphs -- On the Tractability of (k,i)-Coloring -- Window Queries for Problems on Intersecting Objects and Maximal Points -- Bounded stub resolution for some maximal 1-planar graphs -- On Structural Parameterizations of Firefighting -- On the Simultaneous Minimum Spanning Trees Problem -- Variations of cops and robbers game on grids -- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps -- On oriented L(p; 1)-labeling -- Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions.

This book constitutes the proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, held in Guwahati, India, in February 2018. The 23 papers presented in this volume were carefully reviewed and selected from 68 submissions. They focus on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). The mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.

ISBN: 9783319741802

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

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and Discrete Applied Mathematics = 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /
LDR:03477nam a22004095i 4500 001 988844
003 DE-He213
005 20200702154514.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319741802 $9 978-3-319-74180-2
024 7 $a 10.1007/978-3-319-74180-2 $2 doi
035 $a 978-3-319-74180-2
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Algorithms and Discrete Applied Mathematics $h [electronic resource] : $b 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings / $c edited by B.S. Panda, Partha P. Goswami.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XVI, 301 p. 58 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 ; $v 10743
505 0 $a Efficient Domination and Efficient Edge Domination: A Brief Survey -- Mixed Unit Interval Bigraphs.-Hamiltonian Path in K1,t-free split Graphs – a Dichotomy -- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems -- Probabilistic Properties of Highly Connected Random Geometric Graphs -- On Indicated Coloring of Some Classes of Graphs -- Line Segment Disk Cover -- Fixed-parameter tractable algorithms for Tracking Set Problems -- Exact computation of the number of accepting paths of an NTM -- Determining Minimal Degree Polynomials of a Cyclic Code of length 2^k over Z8 -- Consistent Subset Problem with two labels -- The Edge Geodetic Number of Product Graphs -- Burning Spiders -- Drawing Graphs on Few Circles and Few Spheres -- On a lower bound for the eccentric connectivity index of graphs -- On the Tractability of (k,i)-Coloring -- Window Queries for Problems on Intersecting Objects and Maximal Points -- Bounded stub resolution for some maximal 1-planar graphs -- On Structural Parameterizations of Firefighting -- On the Simultaneous Minimum Spanning Trees Problem -- Variations of cops and robbers game on grids -- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps -- On oriented L(p; 1)-labeling -- Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions.
520 $a This book constitutes the proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, held in Guwahati, India, in February 2018. The 23 papers presented in this volume were carefully reviewed and selected from 68 submissions. They focus on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). 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 Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer graphics. $3 561602
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Graphics. $3 669895
700 1 $a Panda, B.S. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1280913
700 1 $a Goswami, Partha P. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1280914
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319741796
776 0 8 $i Printed edition: $z 9783319741819
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-74180-2
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)