000 04327nam a22003975i 4500
001 297810
003 MX-SnUAN
005 20160429155436.0
007 cr nn 008mamaa
008 150903s2007 gw | o |||| 0|eng d
020 _a9783540748397
_99783540748397
024 7 _a10.1007/9783540748397
_2doi
035 _avtls000350964
039 9 _a201509030430
_bVLOAD
_c201405060243
_dVLOAD
_y201402171110
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aBrandstädt, Andreas.
_eeditor.
_9333766
245 1 0 _aGraph-Theoretic Concepts in Computer Science :
_b33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers /
_cedited by Andreas Brandstädt, Dieter Kratsch, Haiko Müller.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
300 _axiii, 344 páginas
_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 ;
_v4769
500 _aSpringer eBooks
505 0 _aComputational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs -- Recognizing Bipartite Tolerance Graphs in Linear Time -- Graph Searching in a Crime Wave -- Monotonicity of Non-deterministic Graph Searching -- Tree-Width and Optimization in Bounded Degree Graphs -- On Restrictions of Balanced 2-Interval Graphs -- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions -- The Clique-Width of Tree-Power and Leaf-Power Graphs -- NLC-2 Graph Recognition and Isomorphism -- A Characterisation of the Minimal Triangulations of Permutation Graphs -- The 3-Steiner Root Problem -- On Finding Graph Clusterings with Maximum Modularity -- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs -- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs -- Approximation Algorithms for Geometric Intersection Graphs -- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem -- Mixing 3-Colourings in Bipartite Graphs -- Minimum-Weight Cycle Covers and Their Approximability -- On the Number of ?-Orientations -- Complexity and Approximation Results for the Connected Vertex Cover Problem -- Segmenting Strings Homogeneously Via Trees -- Characterisations and Linear-Time Recognition of Probe Cographs -- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete -- Proper Helly Circular-Arc Graphs -- Pathwidth of Circular-Arc Graphs -- Characterization and Recognition of Digraphs of Bounded Kelly-width -- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms -- Obtaining a Planar Graph by Vertex Deletion -- Mixed Search Number and Linear-Width of Interval and Split Graphs -- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation -- The Complexity of Bottleneck Labeled Graph Problems.
520 _aThis book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007. The 30 revised full papers presented together with 1 invited paper were carefully selected from 99 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aKratsch, Dieter.
_eeditor.
_9329860
700 1 _aMüller, Haiko.
_eeditor.
_9333767
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540748380
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-74839-7
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c297810
_d297810