LEADER 05541nam 22007815 450 001 996465973803316 005 20230329201604.0 010 $a3-642-35926-4 024 7 $a10.1007/978-3-642-35926-2 035 $a(CKB)3400000000102971 035 $a(SSID)ssj0000870839 035 $a(PQKBManifestationID)11442262 035 $a(PQKBTitleCode)TC0000870839 035 $a(PQKBWorkID)10818570 035 $a(PQKB)11241783 035 $a(DE-He213)978-3-642-35926-2 035 $a(MiAaPQ)EBC3068793 035 $a(PPN)168329557 035 $a(EXLCZ)993400000000102971 100 $a20121227d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Algorithms$b[electronic resource] $e23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers /$fedited by W. F. Symth, Subramanian Arumugam 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (XII, 303 p. 136 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7643 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-35925-6 320 $aIncludes bibliographical references and index. 327 $aBounds 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7643 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aEnvironmental management 606 $aAlgorithms 606 $aMachine theory 606 $aArtificial intelligence?Data processing 606 $aDiscrete Mathematics in Computer Science 606 $aEnvironmental Management 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aData Science 606 $aSymbolic and Algebraic Manipulation 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aEnvironmental management. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aArtificial intelligence?Data processing. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aEnvironmental Management. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 615 24$aData Science. 615 24$aSymbolic and Algebraic Manipulation. 676 $a511/.6 702 $aSymth$b W. F$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aArumugam$b Subramanian$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Combinatorial Algorithms 906 $aBOOK 912 $a996465973803316 996 $aCombinatorial Algorithms$92868813 997 $aUNISA