000 03615nam a22003855i 4500
001 298792
003 MX-SnUAN
005 20160429155519.0
007 cr nn 008mamaa
008 150903s2008 gw | o |||| 0|eng d
020 _a9783540797234
_99783540797234
024 7 _a10.1007/9783540797234
_2doi
035 _avtls000351915
039 9 _a201509030451
_bVLOAD
_c201405060257
_dVLOAD
_y201402171148
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aGrohe, Martin.
_eeditor.
_9327223
245 1 0 _aParameterized and Exact Computation :
_bThird International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings /
_cedited by Martin Grohe, Rolf Niedermeier.
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 ;
_v5018
500 _aSpringer eBooks
505 0 _aRandomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters -- Algorithmic Graph Minors and Bidimensionality -- Algorithmic Meta-theorems -- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem -- Fixed Structure Complexity -- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees -- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs -- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem -- Capacitated Domination and Covering: A Parameterized Perspective -- Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems -- A Purely Democratic Characterization of W[1] -- Parameterized Complexity and Approximability of the SLCS Problem -- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs -- Wheel-Free Deletion Is W[2]-Hard -- Parameterized Derandomization -- A Linear Kernel for Planar Feedback Vertex Set -- Parameterized Chess -- The Time Complexity of Constraint Satisfaction -- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances -- Exact Algorithms for Edge Domination.
520 _aThis book constitutes the refereed proceedings of the Third International Workshop on Parameterized and Exact Computation, IWPEC 2008, held in Victoria, Canada, in May 2008 - co-located with the 40th ACM Symposium on Theory of Computing, STOC 2008. The 17 revised full papers presented together with 3 invited lectures were carefully reviewed and selected from 32 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized computation, implementation and experiments, high-performance computing and fixed-parameter tractability.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aNiedermeier, Rolf.
_eeditor.
_9335365
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540797227
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-79723-4
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c298792
_d298792