Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings. ([2018])
- Record Type:
- Book
- Title:
- Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings. ([2018])
- Main Title:
- Algorithms and discrete applied mathematics : 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings
- Further Information:
- Note: Edited by B.S. Panda, Partha P. Goswami.
- Editors:
- Panda, B. S
Goswami, Partha P - Other Names:
- CALDAM (Conference), 4th
- 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.
- Publisher Details:
- Switzerland : Springer
- Publication Date:
- 2018
- Extent:
- 1 online resource (XVI, 301 pages), 58 illustrations
- Subjects:
- 005.1
Computer science
Computer science -- Mathematics -- Congresses
Algorithms -- Congresses
Data structures (Computer science)
Computer science
Algorithms
Computer science -- Mathematics
Computer graphics
Computers -- Data Processing
Computers -- Data Modeling & Design
Computers -- Computer Graphics
Computers -- Programming -- Algorithms
Mathematical theory of computation
Algorithms & data structures
Graphics programming
Numerical analysis
Computer software
Data structures (Computer science)
Computer graphics
Algorithms
Electronic books - Languages:
- English
- ISBNs:
- 9783319741802
3319741802 - Related ISBNs:
- 9783319741796
3319741799 - Notes:
- Note: Includes bibliographical references and author index.
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.367088
- Ingest File:
- 01_343.xml