My Wish Lists Login / Join

Combinatorial Algorithms

21st International Workshop, Iwoca 2010, London, Uk, July 26-28, 2010, Revised Selected Papers

By: Costas S. Iliopoulos (Editor), William F. Smyth (Editor)

Write A Review

Paperback | 16 March 2011

At a Glance

Paperback
432 Pages

Dimensions(cm)
24.13 x 16.51 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

Parameterized algorithams for the independent set problem in some hereditary graph classes	p. 1
On the maximal Sum of Exponents of Runs in a String	p. 10
Path-Based Supports for Hypergraphs
On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs
Thread graphs, linear Rank-Width and Their Algorithmic Applications	p. 38
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three	p. 43
Shortest paths between shortest paths and independent sets	p. 56
Faster Bit-Parrallel Algorithams for Unordered Pseudo-tree Matching and Tree Homeomorphism	p. 68
Dichotomy for coloring of dart graphs	p. 82
Worst case efficient single and multiple string matching in the RAM model	p. 90
The (2,1)-Total Labelimg Number of Outerplanar Graphs is at most ¿ + 2	p. 103
Upper and lower I/O Bounds for Pebbling r-pyramids	p. 107
Single Parameter FPT-Algorithms for Non-trivial Games
The Complexity Status of Problems Related to Sparsest Cuts	p. 125
On Approximation Complexity of Metric Dimension Problem	p. 136
Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates	p. 140
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures	p. 154
Computing Role Assignments of Proper Interval Graphs in Polynomial Time	p. 167
Efficient Connectivity Testing of Hypercubic Networks with Faults	p. 181
Reductions of Matrices Associated with Nowhere-Zero flows	p. 192
Blocks of Hypergraphs: Applied to Hypergraphs and Outerplanarity	p. 201
Testing the Simultaneous Embeddability of Two Graphs Whose intersection Is a Biconnected Graph or a Tree	p. 212
Skip Lift: A Probabilistic Alternative to Red-Black Trees	p. 226
On a relationship between Completely Separating Systems and Antimagic labeling of Regular Graphs	p. 238
Parameterized Complexity of k-Anonymity: Hardness and Tractability	p. 242
On fast Enummeration of Pseudo Bicliques	p. 256
Efficient Chaining of seeds in Ordered Trees	p. 260
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs	p. 274
Recognition of Probe Ptolemaic Graphs(Ectended Abstract)	p. 286
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences	p. 291
On Antimagic Labing for Generalized Web and Flower Graphs	p. 303
Chains-into-Bins processes	p. 314
Complexity of Locality Injective Homomorphism to the Theta Graphs	p. 326
Ranking and Drawing in Suberponential Time	p. 337
Efficient Reconstruction of RC-Equivalent strings	p. 349
Improved Points Approximation Algorithms Based on Simplical Thickness Data Structures	p. 363
The Cover Time of Cartesian Product Graphs	p. 377
Dictionary-Symbolwise Flexible Parsing	p. 390
Regular Language Constrained Sequence Alignment Eevisited	p. 404
Author index	p. 417
Table of Contents provided by Ingram. All Rights Reserved.

Combinatorial Algorithms

21st International Workshop, Iwoca 2010, London, Uk, July 26-28, 2010, Revised Selected Papers

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Information theory

Nexus

A Brief History of Information Networks from the Stone Age to AI

The Black Swan

The Impact of the Highly Improbable

Psycho-Cybernetics (Updated and Expanded)

Psycho-cybernetics

The Unaccountability Machine

Why Big Systems Make Terrible Decisions

Thinking in Systems

A Primer

The Laws of Thought

The Quest for a Mathematical Theory of the Mind

Effective Machine Learning Teams

Best Practices for ML Practitioners

Psycho-Cybernetics 365

Thrive and Grow Every Day of the Year

Complex Networks and Control Theory

An Introduction to Structural Controllability and Its Biological Applications

This Is Chaos: Embracing the Future of Magic

15 Essays on Chaos Magic for Modern Practitioners

Data and Model-Centric Artificial Intelligence for Industry 5.0

Brain-Inspired AI for Sustainable Development

Knowledge-based Engineering for Innovation

MCP For Dummies

Handbook of Systems Thinking Methods

Beyond the Facts

Tacit Knowledge and the Hidden Infrastructure of Our Informed Times

An Introduction to Systems Biology

Design Principles of Biological Circuits

The Movement of Knowledge

Thinking with Infrastructure

Advances in Materials, Mechanics and Manufacturing IV

Proceedings of The Fifth International Conference on Advanced Materials, Mechanics and Manufacturing (A3M'2025), June 13-15, 2025, Hammamet, Tunisia

Markov Decision Processes and Reinforcement Learning

Proper Time and Mass as Dynamical Variables

Why it's Possible and Some Consequences

Deep Learning with R, Third Edition

Build Python Web Apps with Streamlit

AI and Data Applications in Minutes

The Infinite Alphabet

And the Laws of Knowledge

Quantum Chaos and Disorder

An Introduction with Sample Programs and Exercises

This product is categorised by