Combinatorial Algorithms -
- Format: Broché Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtre74,35 €
Produit Neuf
Ou 18,59 € /mois
- Livraison à 0,01 €
- Livré entre le 1 et le 13 juillet
Brand new, In English, Fast shipping from London, UK; Tout neuf, en anglais, expédition rapide depuis Londres, Royaume-Uni;ria9783642359255_dbm
Nos autres offres
-
85,74 €
Produit Neuf
Ou 21,44 € /mois
- Livraison : 25,00 €
- Livré entre le 15 et le 20 juillet
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Combinatorial Algorithms Format Broché - Livre Informatique
0 avis sur Combinatorial Algorithms Format Broché - Livre Informatique
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
-
Official Game Guide Mass Effect 3 Collector Edition
Occasion dès 79,00 €
-
Financial & Managerial Accounting Ise
Neuf dès 104,72 €
-
Gregory Crewdson
Occasion dès 100,00 €
-
Thematic Apperception Test
1 avis
Neuf dès 78,88 €
Occasion dès 101,09 €
-
Colloquial Arabic (Levantine)
Neuf dès 90,80 €
-
The Arthur Rackham Art Book - Volume I
Neuf dès 63,87 €
-
Written Exposure Therapy For Ptsd
Neuf dès 51,28 €
-
E-Words - Le Vocabulaire Des Nouvelles Technologies
Neuf dès 49,00 €
-
Hito Steyerl: I Will Survive
Neuf dès 39,00 €
-
Car Racing 1965
Neuf dès 109,00 €
Occasion dès 61,58 €
-
Cambridge English Exam Booster For First And First For Schools Without Answer Key With Audio
Neuf dès 40,43 €
-
Photographer's Guide To The Panasonic Lumix Dc-Zs70/Tz90
Neuf dès 42,24 €
-
Aprilia Rsv 1000 Mille (98 -03)
Neuf dès 46,20 €
-
Manolo Blahn¿Drawings
Neuf dès 40,00 €
-
Fujifilm X-E5
Neuf dès 58,99 €
-
Livre Relié « A Bigger Picture » David Hockney
Occasion dès 60,00 €
-
Egyptian Revival Jewelry & Design
Neuf dès 48,28 €
-
Vampire: The Masquerade
Occasion dès 44,90 €
-
Marilyn Monroe
Neuf dès 44,00 €
Occasion dès 62,00 €
-
Mein Kampf
Neuf dès 50,88 €
Produits similaires
Présentation Combinatorial Algorithms Format Broché
- Livre Informatique
Résumé :
This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012. The 32 revised full papers presented were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections in algorithms and data Structures, applications (including Bioinformatics, Networking, etc.), combinatorics of words and strings, combinatorial optimization, combinatorial enumeration, decompositions and combinatorial designs, complexity theory (structural and computational), computational biology and graph theory and combinatorics submissions.
Sommaire:
Bounds on Quasi-Completeness.- Infinite Random Geometric Graphs from the Hexagonal Metric.- Saving on Phases: Parameterized Approximation for Total Vertex Cover.- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths.- Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction.- On Some Properties of Doughnut Graphs (Extended Abstract).- On the Steiner Radial Number of Graphs.- Further Results on the Mycielskian of Graphs.- Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data Instances.- Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter.- Acyclic Coloring with Few Division Vertices.- Degree Associated Edge Reconstruction Number.- Touring Polygons: An Approximation Algorithm.- Super Connectivity of the Generalized Mycielskian of Graphs.- A Graph Radio k-Coloring Algorithm.- Maximum Order of a Planar Oclique Is 15.- Sufficient Condition for {C4, C2t} - Decomposition of K2m,2n ? An Improved Bound.- Incomparability Graphs of Lattices II.- On Antimagic Labeling of Odd Regular Graphs.- A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations.- Deterministic Fuzzy Automata on Fuzzy Regular ?-Languages.- Border Array for Structural Strings.- Computing the Partial Word Avoidability Indices of Ternary Patterns.- Computing a Longest Common Palindromic Subsequence.- Multiset, Set and Numerically Decipherable Codes over Directed Figures.- A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching.- A Catalogue of Algorithms for Building Weak Heaps.- On Counting Range Maxima Points in Plane.- Indexing Highly Repetitive Collections.- Range Extremum Queries.- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations.- GRP CH Heuristic for Generating Random Simple Polygon.
Détails de conformité du produit
Personne responsable dans l'UE