000 04152nam a22005775i 4500
001 978-3-319-74180-2
003 DE-He213
005 20240423125057.0
007 cr nn 008mamaa
008 180115s2018 sz | s |||| 0|eng d
020 _a9783319741802
_9978-3-319-74180-2
024 7 _a10.1007/978-3-319-74180-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aAlgorithms and Discrete Applied Mathematics
_h[electronic resource] :
_b4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /
_cedited by B.S. Panda, Partha P. Goswami.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aXVI, 301 p. 58 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10743
505 0 _aEfficient 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 _aThis 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 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer graphics.
650 1 4 _aAlgorithms.
650 2 4 _aMathematics of Computing.
650 2 4 _aData Science.
650 2 4 _aComputer Graphics.
700 1 _aPanda, B.S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGoswami, Partha P.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319741796
776 0 8 _iPrinted edition:
_z9783319741819
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10743
856 4 0 _uhttps://doi.org/10.1007/978-3-319-74180-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c173968
_d173968