000 03803nam a22003855i 4500
001 297888
003 MX-SnUAN
005 20190830114524.0
007 cr nn 008mamaa
008 150903s2008 gw | o |||| 0|eng d
020 _a9783540778912
_99783540778912
024 7 _a10.1007/9783540778912
_2doi
035 _avtls000351548
039 9 _a201509030449
_bVLOAD
_c201405060252
_dVLOAD
_y201402171139
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _9333875
_aNakano, Shin-ichi.
_eeditor.
245 1 0 _aWALCOM: Algorithms and Computation :
_bSecond International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008. Proceedings /
_cedited by Shin-ichi Nakano, Md. Saidur Rahman.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4921
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aRahman, Md. Saidur.
_eeditor.
_9333876
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540778905
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-77891-2
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c297888
_d297888