SFr. 103.00
€ 111.24


bestellen

Artikel-Nr. 39707180


Diesen Artikel in meine
Wunschliste
Diesen Artikel
weiterempfehlen
Diesen Preis
beobachten

Weitersagen:


Herausgeber: 
  • Anil Maheshwari
  • Subrahmanyam Kalyanasundaram
  • Algorithms and Discrete Applied Mathematics: 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings 
     

    (Buch)
    Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 3 Artikel!


    Übersicht

    Auf mobile öffnen
     
    Lieferstatus:   i.d.R. innert 5-10 Tagen versandfertig
    Veröffentlichung:  Januar 2024  
    Genre:  EDV / Informatik 
     
    approximationalgorithms / approximationtheory / ArtificialIntelligence / Bildverarbeitung / bipartitegraphs / coloring / ComputerNetworks
    ISBN:  9783031522123 
    EAN-Code: 
    9783031522123 
    Verlag:  Springer 
    Einband:  Kartoniert  
    Sprache:  English  
    Dimensionen:  H 235 mm / B 155 mm / D 20 mm 
    Gewicht:  534 gr 
    Seiten:  352 
    Bewertung: Titel bewerten / Meinung schreiben
    Inhalt:
    ¿Algorithms and Complexity.- Consecutive Occurrences with Distance Constraints.- Parameterized Aspects of Distinct Kemeny Rank Aggregation.- Monitoring Edge-geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.- Distance-2-Dispersion with Termination by a Strong Team.- On Query Complexity Measures and their Relations for Symmetric Functions.- Computational Geometry.- Growth Rate of the Number of Empty Triangles in the Plane.- Geometric Covering Number: Covering Points with Curves.- Improved Algorithms for Minimum-Membership Geometric Set Cover.- Semi-total Domination in Unit Disk Graphs.- Discrete Applied Mathematics.- An Efficient Interior Point Method for Linear Optimization using Modified Newton Method.- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs.- The Frobenius Problem for the Proth Numbers.- Graph Algorithms.- Eternal Connected VertexCover Problem in Graphs: Complexity and Algorithms.- Impact of Diameter and Convex Ordering for Hamiltonicity and Domination.- On Star Partition of Split Graphs.- Star Covers and Star Partitions of Cographs and Butterfly-free Graphs.- Open Packing in H-free Graphs and Subclasses of Split Graphs.- Graph Theory.- Location-domination Type Problems Under the Mycielski Construction.- On Total Chromatic Number of Complete Multipartite Graphs.- The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability.- Total Coloring of Some Graph Operations.- Star Colouring of Regular Graphs Meets Weaving and Line Graphs.

      
     Empfehlungen... 
     Algorithms and Discrete Applied Mathematics: Third - (Buch)
     Algorithms and Discrete Applied Mathematics: 6th I - (Buch)
     Algorithms and Discrete Applied Mathematics: First - (Buch)
     Algorithms and Discrete Applied Mathematics: Secon - (Buch)
     Algorithms and Discrete Applied Mathematics: 7th I - (Buch)
     Algorithms and Discrete Applied Mathematics: 9th I - (Buch)
     Algorithms and Discrete Applied Mathematics: 5th I - (Buch)
     Algorithms and Discrete Applied Mathematics: 8th I - (Buch)
     Algorithms and Discrete Applied Mathematics: 4th I - (Buch)
     Algorithms and Discrete Applied Mathematics: 11th - (Buch)
     Weitersuchen in   DVD/FILME   CDS   GAMES   BÜCHERN   



    Wird aktuell angeschaut...
     

    Zurück zur letzten Ansicht


    AGB | Datenschutzerklärung | Mein Konto | Impressum | Partnerprogramm
    Newsletter | 1Advd.ch RSS News-Feed Newsfeed | 1Advd.ch Facebook-Page Facebook | 1Advd.ch Twitter-Page Twitter
    Forbidden Planet AG © 1999-2026
    Alle Angaben ohne Gewähr
     
    SUCHEN

     
     Kategorien
    Im Sortiment stöbern
    Genres
    Hörbücher
    Aktionen
     Infos
    Mein Konto
    Warenkorb
    Meine Wunschliste
     Kundenservice
    Recherchedienst
    Fragen / AGB / Kontakt
    Partnerprogramm
    Impressum
    © by Forbidden Planet AG 1999-2026