LEADER 03905oam 2200637 450 001 9910143468803321 005 20210714221402.0 010 $a3-540-49494-4 024 7 $a10.1007/b71621 035 $a(CKB)1000000000211016 035 $a(SSID)ssj0000323631 035 $a(PQKBManifestationID)11285429 035 $a(PQKBTitleCode)TC0000323631 035 $a(PQKBWorkID)10303435 035 $a(PQKB)11544441 035 $a(SSID)ssj0000715679 035 $a(PQKBManifestationID)11400822 035 $a(PQKBTitleCode)TC0000715679 035 $a(PQKBWorkID)10703644 035 $a(PQKB)21402008 035 $a(DE-He213)978-3-540-49494-2 035 $a(MiAaPQ)EBC3088465 035 $a(MiAaPQ)EBC6485658 035 $a(PPN)155196359 035 $a(EXLCZ)991000000000211016 100 $a20210714d1998 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aGraph-theoretic concepts in computer science $e24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings /$fedited by Juraj Hromkovič; Ondrej Sýkora 205 $a1st ed. 1998. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1998] 210 4$d©1998 215 $a1 online resource (X, 394 p.) 225 1 $aLecture notes in computer science ;$vVolume 1517 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-65195-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aLinear Time Solvable Optimization Problems on Graphs of Bounded Clique Width -- Minus Domination in Small-Degree Graphs -- The Vertex-Disjoint Triangles Problem -- Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode -- Broadcasting on Anonymous Unoriented Tori -- Families of Graphs Having Broadcasting and Gossiping Properties -- Optical All-to-All Communication in Inflated Networks -- A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking -- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees -- Rankings of Directed Graphs -- Drawing Planar Partitions II: HH-Drawings -- Triangles in Euclidean Arrangements -- Internally Typed Second-Order Term Graphs -- Compact Implicit Representation of Graphs -- Graphs with Bounded Induced Distance -- Diameter Determination on Restricted Graph Families -- Independent Tree Spanners -- Upgrading Bottleneck Constrained Forests -- Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition -- Improved Compressions of Cube-Connected Cycles Networks -- Efficient Embeddings of Grids into Grids -- Integral Uniform Flows in Symmetric Networks -- Splitting Number is NP-Complete -- Tree Spanners in Planar Graphs -- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs -- Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases -- Domination and Steiner Tree Problems on Graphs with Few P 4s -- Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs -- Interval Completion with the Smallest Max-Degree -- An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. 410 0$aLecture notes in computer science ;$vVolume 1517. 606 $aElectronic data processing$vCongresses 606 $aGraph theory$vCongresses 615 0$aElectronic data processing 615 0$aGraph theory 676 $a004.0151 702 $aSýkora$b Ondrej 702 $aHromkovič$b Juraj$f1958- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910143468803321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA