Algorithms and discrete applied mathematics : Second International Conference, CALDAM 2016 Thiruvananthapuram, India, February 18-20, 2016 Proceedings /: Second International Conference, CALDAM 2016 Thiruvananthapuram, India, February 18-20, 2016 Proceedings. (2016)
- Record Type:
- Book
- Title:
- Algorithms and discrete applied mathematics : Second International Conference, CALDAM 2016 Thiruvananthapuram, India, February 18-20, 2016 Proceedings /: Second International Conference, CALDAM 2016 Thiruvananthapuram, India, February 18-20, 2016 Proceedings. (2016)
- Main Title:
- Algorithms and discrete applied mathematics : Second International Conference, CALDAM 2016 Thiruvananthapuram, India, February 18-20, 2016 Proceedings
- Further Information:
- Note: Sathish Govindarajan, Anil Maheshwari (Eds.).
- Editors:
- Govindarajan, Sathish, 1976-
Maheshwari, Anil - Other Names:
- CALDAM (Conference), 2nd
- Contents:
- Algorithms for Problems on Maximum Density Segment.- Distance spectral radius of k-partitioned transmission regular graphs.- Color Spanning Objects: Algorithms and Hardness Results.- On Hamiltonian colorings of trees.- On the Complexity Landscape of the Domination Chain.- On the probability of being synchronizable.- Linear-Time Fitting of a k-Step Function.- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications.- Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions.- Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints.- Lower Bounds on the Dilation of Plane Spanners.- Lattice Spanners of Low Degree.- AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables.- Approximation Algorithms for Cumulative VRP with Stochastic Demands.- Some Distance Antimagic Labelled Graphs.- A New Construction of Broadcast Graphs.- Improved Algorithm for Maximum Independent Set on Unit Disk Graph.- Independent Sets in Classes Related to Chair-free Graphs.- Cyclic Codes over Galois Rings.- On The Center Sets of Some Graph Classes.- On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices.- Medians of permutations : building constraints.- b-Disjunctive total domination in graphs: Algorithm and hardness results.- m-Gracefulness of Graphs.- Domination Parameters in Hypertree.- Complexity of Steiner Tree in Split Graphs - DichotomyAlgorithms for Problems on Maximum Density Segment.- Distance spectral radius of k-partitioned transmission regular graphs.- Color Spanning Objects: Algorithms and Hardness Results.- On Hamiltonian colorings of trees.- On the Complexity Landscape of the Domination Chain.- On the probability of being synchronizable.- Linear-Time Fitting of a k-Step Function.- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications.- Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions.- Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints.- Lower Bounds on the Dilation of Plane Spanners.- Lattice Spanners of Low Degree.- AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables.- Approximation Algorithms for Cumulative VRP with Stochastic Demands.- Some Distance Antimagic Labelled Graphs.- A New Construction of Broadcast Graphs.- Improved Algorithm for Maximum Independent Set on Unit Disk Graph.- Independent Sets in Classes Related to Chair-free Graphs.- Cyclic Codes over Galois Rings.- On The Center Sets of Some Graph Classes.- On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices.- Medians of permutations : building constraints.- b-Disjunctive total domination in graphs: Algorithm and hardness results.- m-Gracefulness of Graphs.- Domination Parameters in Hypertree.- Complexity of Steiner Tree in Split Graphs - Dichotomy Results.- Relative clique number of planar signed graphs.- The cd-coloring of graphs.- Characterization of H-graphs.- On the Power Domination Number of Graph Products. … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2016
- Copyright Date:
- 2016
- Extent:
- 1 online resource (369 pages)
- Subjects:
- 005.1
Computer science
Computer algorithms -- Congresses
Computer science -- Mathematics -- Congresses
Computers -- Data Modeling & Design
Computers -- Data Processing
Computers -- Programming -- Algorithms
Computers -- Computer Graphics
Algorithms & data structures
Discrete mathematics
Mathematical theory of computation
Graphics programming
Numerical analysis
Computer software
Data structures (Computer science)
Computational complexity
Electronic data processing
Computer graphics
Algorithms - Languages:
- English
- ISBNs:
- 9783319292212
- Related ISBNs:
- 9783319292205
- 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.374920
- Ingest File:
- 02_354.xml