Muutke küpsiste eelistusi

E-raamat: Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 86,44 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023.

The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering.

Stable Approximation Schemes.- A whirlwind tour of intersection graph
enumeration.- Graph modification problems with forbidden minors.- Algorithms
& Optimization Efficient reductions and algorithms for Subset Product.-
Optimal length cutting plane refutations of integer programs.- Fault-Tolerant
Dispersion Resource management in device-to-device communications.-
Computational Geometry Algorithms for k-Dispersion for Points in Convex
Position in the Plane.- Arbitrary oriented color spanning region for line
segments.- Games with a Simple Rectilinear Obstacle in Plane.- Diverse Fair
Allocations: Complexity and Algorithms.- Graph Coloring New bounds and
constructions for neighbor-locating colorings of graphs.- D K 5-list coloring
toroidal 6-regular triangulations in linear time.- On Locally Identifying
Coloring of Graphs.- On Structural Parameterizations of Star Coloring.- Reddy
Perfectness of G-generalized join of graphs.- Coloring of a superclass of
2K2-free graphs.- The Weak (2,2)-Labelling Problem for graphs with forbidden
induced structures.- Graph Connectivity Short cycles dictate dichotomy status
of the Steiner tree problem on Bisplit graphs.- Some insights on dynamic
maintenance of Gomory-Hu tree in cactus graphs and general graphs.-
Monitoring edge-geodetic sets in graphs.- Cyclability, Connectivity and
Circumference.- Graph Domination On three domination-based identification
problems in block graphs.- Graph modification problems with forbidden
minors.- Computational Aspects of Double Dominating Sequences in Graph.-
Relation between broadcast domination and multipacking numbers on chordal
graphs.- Pushing Cops and Robber on Oriented Graphs.- Mind the Gap: Edge
Facility Location Problems in Theory and Practice.- Complexity Results on
Cosecure Domination in Graphs.- Kusum and Arti Pandey Graph Matching Latin
Hexahedra and Related Combinatorial Structures.- Minimum Maximal Acyclic
Matching in Proper Interval Graphs.- Graph Partition & Graph Covering
Transitivity on subclasses of chordal graphs.- Maximum subgraph problem for
3-regular Knödel graphs and its wirelength.- Covering using Bounded Size
Subgraphs.- Axiomatic characterization of the the toll walk function of some
graph classes.- Structural Parameterization of Alliance Problems.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830312521122e.html
Märksõnad: