Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Discrete Applied Mathematics: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings de B.S. Panda

Algorithms and Discrete Applied Mathematics: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings: Lecture Notes in Computer Science, cartea 10743

Editat de B.S. Panda, Partha P. Goswami
en Limba Engleză Paperback – 17 ian 2018
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32086 lei

Preț vechi: 40108 lei
-20%

Puncte Express: 481
Preț estimativ în valută:
5672€ • 6763$ • 4920£

Carte tipărită la comandă

Livrare economică 16-30 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319741796
ISBN-10: 3319741799
Pagini: 400
Ilustrații: XVI, 301 p. 58 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.45 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.