| Description |
1 online resource (xi, 302 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 7643 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7643.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
880-01 Bounds on Quasi-Completeness / Malay Bhattacharyya, Sanghamitra Bandyopadhyay -- Infinite Random Geometric Graphs from the Hexagonal Metric / Anthony Bonato, Jeannette Janssen -- Saving on Phases: Parameterized Approximation for Total Vertex Cover / Henning Fernau -- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths / Florent Foucaud, Matjaž Kovše -- Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction / Wojciech Fraczak, Andrew Miller -- On Some Properties of Doughnut Graphs / Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman -- On the Steiner Radial Number of Graphs / K.M. Kathiresan, S. Arockiaraj, R. Gurusamy, K. Amutha -- Further Results on the Mycielskian of Graphs / T. Kavaskar |
|
880-01/(S 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 |
|
Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data Instances / Niraj Ramesh Dayama, Ketki Kulkarni -- Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter / Jay Mahadeokar, Sanjeev Saxena -- Acyclic Coloring with Few Division Vertices / Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman -- Degree Associated Edge Reconstruction Number / S. Monikandan, S. Sundar Raj -- Touring Polygons: An Approximation Algorithm / Amirhossein Mozafari, Alireza Zarei -- Super Connectivity of the Generalized Mycielskian of Graphs / S. Francis Raj -- A Graph Radio k-Coloring Algorithm / Laxman Saha, Pratima Panigrahi -- Maximum Order of a Planar Oclique Is 15 / Sagnik Sen |
|
Sufficient Condition for {C ₄, C ₂t } -- Decomposition of K ₂m, ₂n -- An Improved Bound / Shanmugasundaram Jeevadoss, Appu Muthusamy -- Incomparability Graphs of Lattices II / Meenakshi Wasadikar, Pradnya Survase -- On Antimagic Labeling of Odd Regular Graphs / Tao-Ming Wang, Guang-Hui Zhang -- A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations / Pritom Ahmed, A.S.M. Shohidull Islam, M. Sohel Rahman Deterministic Fuzzy Automata on Fuzzy Regular [omega]-Languages / R. Arulprakasam, V.R. Dare, S. Gnanasekaran -- Border Array for Structural Strings / Richard Beal, Donald Adjeroh -- Computing the Partial Word Avoidability Indices of Ternary Patterns / Francine Blanchet-Sadri, Andrew Lohr, Shane Scott -- Computing a Longest Common Palindromic Subsequence / Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal |
|
Multiset, Set and Numerically Decipherable Codes over Directed Figures / Michał Kolarz, Włodzimierz Moczurad -- A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching / Bruce W. Watson, Derrick G. Kourie, Tinus Strauss -- A Catalogue of Algorithms for Building Weak Heaps / Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen -- On Counting Range Maxima Points in Plane / Anil Kishore Kalavagattu, Jatin Agarwal, Ananda Swarup Das -- Indexing Highly Repetitive Collections / Gonzalo Navarro -- Range Extremum Queries / Rajeev Raman -- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations / Ray Jinzhu Chen, Kevin Scott Reschke, Hailong Hu -- GRP_CH Heuristic for Generating Random Simple Polygon / Sanjib Sadhu, Subhashis Hazarika, Kapil Kumar Jain, Saurav Basu |
| Summary |
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 |
| Notes |
Print version record |
| Subject |
Combinatorial analysis -- Congresses
|
|
Algorithms -- Congresses
|
|
Informatique.
|
|
Algorithms
|
|
Combinatorial analysis
|
| Genre/Form |
Conference papers and proceedings
|
|
Software.
|
| Form |
Electronic book
|
| Author |
Arumugam, S
|
|
Smyth, Bill.
|
| ISBN |
9783642359262 |
|
3642359264 |
|
3642359256 |
|
9783642359255 |
|
