Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Discrete Applied Mathematics: 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings de Manoj Changat

Algorithms and Discrete Applied Mathematics: 6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12016

Editat de Manoj Changat, Sandip Das
en Limba Engleză Paperback – 25 ian 2020
This book constitutes the proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, held in Hyderabad, India, in February 2020. The 38 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on graph algorithms, graph theory, combinatorial optimization, distributed algorithms, combinatorial algorithms, and computational complexity.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 47798 lei

Preț vechi: 56233 lei
-15% Nou

Puncte Express: 717
Preț estimativ în valută:
9154€ • 9431$ • 7668£

Carte tipărită la comandă

Livrare economică 24 februarie-10 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030392185
ISBN-10: 303039218X
Pagini: 300
Ilustrații: XX, 490 p. 151 illus., 36 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.71 kg
Ediția:1st ed. 2020
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

0-1 Timed Matching in Bipartite Temporal Graphs.- Partitioning cographs into two forests and one independent set.- Monitoring the edges of a graph using distances.- Forbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method.- Approximating Modular Decomposition is Hard.- Vertex Edge Dominating Set in Unit Disk Graphs.- Geometric Planar Networks on Bichromatic Points.- Algorithmic Aspects of Global Total k-Domination in Graphs.- Hardness and approximation for the geodetic set problem in some graph classes.- Maximum Weighted Edge Biclique Problem on Bipartite Graphs.- Determining Number of Generalized and Double Generalized Petersen Graph.- Self-centeredness of generalized Petersen Graphs.- Weak Roman Bondage Number of a Graph.- On the geodetic and hull numbers of shadow Graphs.- Indicated coloring of complete expansion and lexicographic product of graphs.- Smallest C2l+1-critical graphs of odd-girth 2k + 1.- Ramsey Numbers for Line Graphs.- On Cartesian products of signed graphs.- List distinguishing number of pth power of hypercube and Cartesian powers of a graph.- On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs.- On the relative oriented clique number of planar graphs.- On the minimmum satisfiability problem.- Waiting for Trains: Complexity Results.- Oriented Diameter of Star Graphs.- Gathering over Meeting Nodes of Infinite Grid.- 0-1 Timed Matching in Bipartite Temporal Graphs.- Arbitrary Pattern Formation by Opaque Fat Robots with Lights.- Greedy universal cycle constructions for weak orders.- A New Model in Firefighting Theory.- An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties.- Overlaying a hypergraph with a graph with bounded maximum degree.- Parameterized Algorithms for Directed Modular Width.- On the Complexity of Spanning Trees with a Small Vertex Cover.- Minimum Conflict free Colouring Parameterized by Treewidth.- Planar projections of graphs.- New Algorithms and Bounds for Halving Pseudolines.- Algorithms for Radon Partitions with Tolerance.