The Resource Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book)
Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book)
Resource Information
The item Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.
This item is available to borrow from 1 library branch.
 Summary
 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
 Language
 eng
 Extent
 1 online resource (XVI, 301 pages 58 illustrations)
 Contents

 Efficient Domination and Efficient Edge Domination: A Brief Survey
 Mixed Unit Interval Bigraphs.Hamiltonian Path in K1,tfree 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
 Fixedparameter 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 2k̂ 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 1planar 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
 Isbn
 9783319741796
 Label
 Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings
 Title
 Algorithms and discrete applied mathematics
 Title remainder
 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings
 Statement of responsibility
 edited by B.S. Panda, Partha P. Goswami
 Language
 eng
 Summary
 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
 Cataloging source
 UPM
 Dewey number
 005.1
 Illustrations
 illustrations
 Index
 no index present
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2018
 http://bibfra.me/vocab/lite/meetingName
 CALDAM (Conference)
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName

 Panda, B. S.
 Goswami, Partha P.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 10743
 http://library.link/vocab/subjectName

 Computer science
 Data structures (Computer science)
 Algorithms
 Computer science
 Computer graphics
 Label
 Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book)
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and author index
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Efficient Domination and Efficient Edge Domination: A Brief Survey  Mixed Unit Interval Bigraphs.Hamiltonian Path in K1,tfree 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  Fixedparameter 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 2k̂ 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 1planar 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
 Control code
 SPR1027041165
 Dimensions
 unknown
 Extent
 1 online resource (XVI, 301 pages 58 illustrations)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783319741796
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319741802
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 on1027041165
 (OCoLC)1027041165
 Label
 Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book)
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and author index
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Efficient Domination and Efficient Edge Domination: A Brief Survey  Mixed Unit Interval Bigraphs.Hamiltonian Path in K1,tfree 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  Fixedparameter 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 2k̂ 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 1planar 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
 Control code
 SPR1027041165
 Dimensions
 unknown
 Extent
 1 online resource (XVI, 301 pages 58 illustrations)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783319741796
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319741802
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 on1027041165
 (OCoLC)1027041165
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics4th/tff94c9DyK0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics4th/tff94c9DyK0/">Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics4th/tff94c9DyK0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Algorithmsanddiscreteappliedmathematics4th/tff94c9DyK0/">Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 1517, 2018, Proceedings, edited by B.S. Panda, Partha P. Goswami, (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>