000 | 04539nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-540-77891-2 | ||
003 | DE-He213 | ||
005 | 20240423125855.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540778912 _9978-3-540-77891-2 |
||
024 | 7 |
_a10.1007/978-3-540-77891-2 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aWALCOM: Algorithms and Computation _h[electronic resource] : _bSecond International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings / _cedited by Shin-ichi Nakano, Md. Saidur Rahman. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXII, 244 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4921 |
|
505 | 0 | _aInvited 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. | |
520 | _aThis 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. | ||
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aNakano, Shin-ichi. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRahman, Md. Saidur. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540778905 |
776 | 0 | 8 |
_iPrinted edition: _z9783540847359 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4921 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-77891-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c182605 _d182605 |