Nantilus
Combinatorial Algorithms : 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers
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 subm...
Enregistré dans:
| Auteurs principaux : | , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Combinatorial Algorithms : 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers / edited by S. Arumugam, W. F. Smyth. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, 2012 Cham : Springer Nature |
| Collection : | Theoretical computer science and general issues (Online) ; 7643 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Sujets : | |
| Documents associés : | Autre format:
Combinatorial Algorithms Autre format: Combinatorial Algorithms |
| LEADER | 05313clm a2200673 4500 | ||
|---|---|---|---|
| 001 | PPN168329557 | ||
| 003 | http://www.sudoc.fr/168329557 | ||
| 005 | 20241001155200.0 | ||
| 010 | |a 978-3-642-35926-2 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-642-35926-2 |2 DOI |
| 035 | |a (OCoLC)829433975 | ||
| 035 | |a Springer978-3-642-35926-2 | ||
| 035 | |a Springer-11645-978-3-642-35926-2 | ||
| 100 | |a 20130325d2012 u u0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a DE | ||
| 105 | |a y z 100yy | ||
| 106 | |a s | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Combinatorial Algorithms |e 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers |f edited by S. Arumugam, W. F. Smyth. | |
| 214 | 0 | |a Berlin, Heidelberg |c Springer Berlin Heidelberg | |
| 214 | 2 | |a Cham |c Springer Nature |d 2012 | |
| 225 | 0 | |a Theoretical Computer Science and General Issues |x 2512-2029 |v 7643 | |
| 330 | |a 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. | ||
| 359 | 1 | |a 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. | |
| 371 | 0 | |a L'accès complet à la ressource est réservé aux usagers des établissements qui en ont fait l'acquisition | |
| 410 | | | |0 200114832 |t Theoretical computer science and general issues (Online) |x 2512-2029 |v 7643 | |
| 452 | | | |t Combinatorial Algorithms |y 9783642359255 | |
| 452 | | | |t Combinatorial Algorithms |y 9783642359279 | |
| 608 | |3 PPN02886431X |a Actes de congrès |2 rameau | ||
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Algorithm Analysis and Problem Complexity | |
| 610 | 2 | |a Mathematical Logic and Formal Languages | |
| 610 | 2 | |a Data Structures | |
| 610 | 2 | |a Discrete Mathematics in Computer Science | |
| 610 | 2 | |a Environmental Management | |
| 610 | 2 | |a Symbolic and Algebraic Manipulation | |
| 610 | 2 | |a Formal Languages and Automata Theory | |
| 610 | 2 | |a Data Science | |
| 610 | 2 | |a Algorithms | |
| 615 | |a @Computer Science |n 11645 |2 Springer | ||
| 676 | |a 004.0151 |v 23 | ||
| 680 | |a QA76.9.M35 | ||
| 701 | 1 | |3 PPN221687750 |a Arumugam |b S. |f 1943-.... |4 651 | |
| 701 | 1 | |a Symth |b W. F. |4 651 | |
| 701 | 1 | |a Arumugam |b Subramanian |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20240611 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20240603 |g AACR2 | |
| 856 | 4 | |5 441099901:830857036 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-642-35926-2 | |
| 915 | |5 441099901:830857036 |b SPRING13-00731 | ||
| 930 | |5 441099901:830857036 |b 441099901 |j g | ||
| 991 | |5 441099901:830857036 |a Exemplaire créé en masse par ITEM le 30-09-2024 16:13 | ||
| 997 | |a NUM |b SPRING13-00731 |d NUMpivo |e EM |s d | ||
| 998 | |a 978561 | ||