Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Discrete Applied Mathematics de Niranjan Balachandran

Algorithms and Discrete Applied Mathematics: Lecture Notes in Computer Science, cartea 13179

Editat de Niranjan Balachandran, R. Inkulu
en Limba Engleză Paperback – 17 ian 2022
This book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022.
The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 48881 lei

Preț vechi: 61101 lei
-20%

Puncte Express: 733

Carte tipărită la comandă

Livrare economică 21 mai-04 iunie

 Adaugă în coș

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

Specificații

ISBN-13: 9783030950170
ISBN-10: 3030950174
Pagini: 340
Ilustrații: XIX, 317 p. 55 illus.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1st edition 2022
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

A proof of the Multiplicative 1-2-3 Conjecture.- The geodesic transversal problem on some networks.- Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free Graphs.- List homomorphisms to separable signed graphs.- Some position problems for graphs.- Comparability graphs among Cover-Incomparability graphs.- Complexity of Paired Domination in AT-free and Planar Graphs.- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs.- On Conflict-Free Spanning Tree: Algorithms and Complexity.- B0-VPG Representation of AT-free Outerplanar Graphs.- P versus NPC : Steiner tree in convex split graphs.- On cd-coloring of {P_5,K_4}-free chordal graphs.- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs.- Covering a Graph with Densest Subgraphs.- Coresets for $(k, \ell)$-Median Clustering under the Fréchet Distance.- Bounds and Algorithms for Geodetic Hulls.- Voronoi Games using Geodesics.- Approximation and parameterized algorithms for balanced connected partition problems.- Algorithms for Online Car-sharing Problem.- Algebraic algorithms for variants of Subset Sum.- Hardness and Approximation Results for Some Variants of Stable Marriage Problem.- On Fair Division with Binary Valuations Respecting Social Networks.- Parameterized Intractability of  Defensive  Alliance Problem.- On the approximability of path and cycle problems in arc-dependent networks}.- Approximation Algorithms in Graphs with Known Broadcast time of the Base Graph.