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

Algorithms and Discrete Applied Mathematics 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings / edited by B.S. Panda, Partha P. Goswami.

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 rela...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Panda, B.S (Editor), Goswami, Partha P. (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2018.
Edition:1st ed. 2018.
Series:Theoretical Computer Science and General Issues ; 10743
Springer eBook Collection.
Subjects:
Algorithms.
Computer science—Mathematics.
Data structures (Computer science).
Computer graphics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items