WALCOM: Algorithms and Computation: Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings: Lecture Notes in Computer Science, cartea 4921
Editat de Shin-ichi Nakano, Md. Saidur Rahmanen Limba Engleză Paperback – 23 ian 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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 325.38 lei 43-57 zile | |
Springer Berlin, Heidelberg – 25 ian 2012 | 408.70 lei 22-36 zile | |
Springer Berlin, Heidelberg – 23 ian 2008 | 325.38 lei 43-57 zile |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 325.38 lei
Preț vechi: 406.73 lei
-20% Nou
Puncte Express: 488
Preț estimativ în valută:
62.27€ • 64.68$ • 51.73£
62.27€ • 64.68$ • 51.73£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540778905
ISBN-10: 354077890X
Pagini: 256
Ilustrații: XII, 244 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.41 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354077890X
Pagini: 256
Ilustrații: XII, 244 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.41 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Textul de pe ultima copertă
This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms and Computation, WALCOM 2012, held in Dhaka, Bangladesh, in February 2012. The 20 full papers presented together with 3 invited papers were carefully reviewed and selected from 50 submissions. The papers are grouped in topical sections on graph algorithms; computational geometry; approximation algorithms; graph drawing; string and data structures; and games and cryptography.
Caracteristici
Up to date results State of the art research Fast-track conference proceedings