Walcom: Algorithms And Computation: Second International Workshop, Walcom 2008, Dhaka, Bangladesh, February by Shin-ichi NakanoWalcom: Algorithms And Computation: Second International Workshop, Walcom 2008, Dhaka, Bangladesh, February by Shin-ichi Nakano

Walcom: Algorithms And Computation: Second International Workshop, Walcom 2008, Dhaka, Bangladesh…

byShin-ichi NakanoEditorSaidur Rahman

Hardcover | January 23, 2008

Pricing and Purchase Info

$95.72 online 
$140.95 list price save 32%
Earn 479 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the Second International Workshop on Algorithms and Computation, WALCOM 2008, held in Dhaka, Bangladesh, in February 2008.

The 19 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 57 submissions. The papers feature original research in the areas of algorithms and data structures, combinatorial algorithms, graph drawings and graph algorithms, parallel and distributed algorithms, string algorithms, computational geometry, graphs in bioinformatics and computational biology. The papers are organized in topical sections on bioinformatics algorithms, computational geometry and graph drawing, graph algorithms, and algorithm engineering.

Title:Walcom: Algorithms And Computation: Second International Workshop, Walcom 2008, Dhaka, Bangladesh…Format:HardcoverDimensions:244 pagesPublished:January 23, 2008Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:354077890X

ISBN - 13:9783540778905

Reviews

Table of Contents

Invited Talks.- Vertex Domination in Dynamic Networks.- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis.- Simple Geometrical Intersection Graphs.- Bioinformatics Algorithms.- On the Approximability of Comparing Genomes with Duplicates.- Indexing Circular Patterns.- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs.- Computational Geometry and Graph Drawing.- Cover Ratio of Absolute Neighbor.- Computing ?-Drawings of 2-Outerplane Graphs in Linear Time.- Upward Drawings of Trees on the Minimum Number of Layers.- Guarding Exterior Region of a Simple Polygon.- Computing Nice Projections of Convex Polyhedra.- Graph Algorithms I.- A Compact Encoding of Plane Triangulations with Efficient Query Supports.- Four-Connected Spanning Subgraphs of Doughnut Graphs.- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.- Algorithm Engineering.- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem.- Multi-commodity Source Location Problems and Price of Greed.- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs.- Optimal Algorithms for Detecting Network Stability.- On Certain New Models for Paging with Locality of Reference.- Graph Algorithms II.- Listing All Plane Graphs.- Pairwise Compatibility Graphs.- Multilevel Bandwidth and Radio Labelings of Graphs.