000 05251nam a22006615i 4500
001 978-3-642-35926-2
003 DE-He213
005 20240730182633.0
007 cr nn 008mamaa
008 121227s2012 gw | s |||| 0|eng d
020 _a9783642359262
_9978-3-642-35926-2
024 7 _a10.1007/978-3-642-35926-2
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCombinatorial Algorithms
_h[electronic resource] :
_b23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers /
_cedited by W. F. Symth, Subramanian Arumugam.
250 _a1st ed. 2012.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXII, 303 p. 136 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7643
505 0 _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.
520 _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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aEnvironmental management.
_914318
650 0 _aAlgorithms.
_93390
650 0 _aMachine theory.
_9128776
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aEnvironmental Management.
_914318
650 2 4 _aAlgorithms.
_93390
650 2 4 _aFormal Languages and Automata Theory.
_9128777
650 2 4 _aData Science.
_934092
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _aSymth, W. F.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9128778
700 1 _aArumugam, Subramanian.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9128779
710 2 _aSpringerLink (Online service)
_9128780
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642359255
776 0 8 _iPrinted edition:
_z9783642359279
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7643
_9128781
856 4 0 _uhttps://doi.org/10.1007/978-3-642-35926-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91445
_d91445