Atjaunināt sīkdatņu piekrišanu

Algorithms and Discrete Applied Mathematics: 6th International Conference, CALDAM 2020, Hyderabad, India, February 1315, 2020, Proceedings 2020 ed. [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 490 pages, height x width: 235x155 mm, weight: 777 g, 36 Illustrations, color; 115 Illustrations, black and white; XX, 490 p. 151 illus., 36 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 12016
  • Izdošanas datums: 25-Jan-2020
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 303039218X
  • ISBN-13: 9783030392185
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 68,33 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 80,39 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Algorithms and Discrete Applied Mathematics: 6th International Conference, CALDAM 2020, Hyderabad, India, February 1315, 2020, Proceedings 2020 ed.Palielināt
  • Formāts: Paperback / softback, 490 pages, height x width: 235x155 mm, weight: 777 g, 36 Illustrations, color; 115 Illustrations, black and white; XX, 490 p. 151 illus., 36 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 12016
  • Izdošanas datums: 25-Jan-2020
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 303039218X
  • ISBN-13: 9783030392185
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783030392185.html
Keywords:

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.

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.