| Description |
1 online resource (xi, 418 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 6460 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6460. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Note continued: Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree / Ignaz Rutter -- Skip Lift: A Probabilistic Alternative to Red-Black Trees / Pat Morin -- On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs / Paulette Lieby -- Parameterized Complexity of k-Anonymity: Hardness and Tractability / Yuri Pirola -- On Fast Enumeration of Pseudo Bicliques / Syed Husnine -- Efficient Chaining of Seeds in Ordered Trees / Anne-Laure Gaillard -- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs / Tomaz Pisanski -- Recognition of Probe Ptolemaic Graphs (Extended Abstract) / Ling-Ju Hung -- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences / Martin Milanic -- On Antimagic Labeling for Generalized Web and Flower Graphs / Leanne Rylands -- Chains-into-Bins Processes / Colin Cooper -- Complexity of Locally Injective Homomorphism to the Theta Graphs / Marek Tesar -- Ranking and Drawing in Subexponential Time / Saket Saurabh -- Efficient Reconstruction of RC-Equivalent Strings / Zsuzsanna Liptak -- Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures / Haitao Wang -- Cover Time of Cartesian Product Graphs / Tomasz Radzik -- Dictionary-Symbolwise Flexible Parsing / Antonio Restivo -- Regular Language Constrained Sequence Alignment Revisited / Michal Ziv-Ukelson |
| Summary |
Annotation This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
Print version record |
| Subject |
Combinatorial analysis -- Data processing -- Congresses
|
|
Algorithms -- Congresses
|
|
Informatique.
|
|
Algorithms.
|
|
Combinatorial analysis -- Data processing.
|
| Genre/Form |
Conference papers and proceedings.
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Iliopoulos, C. S. (Costas S.)
|
|
Smyth, Bill.
|
| ISBN |
9783642192227 |
|
364219222X |
|
