03903oam 2200637 450 99646610950331620210714221402.03-540-49494-410.1007/b71621(CKB)1000000000211016(SSID)ssj0000323631(PQKBManifestationID)11285429(PQKBTitleCode)TC0000323631(PQKBWorkID)10303435(PQKB)11544441(SSID)ssj0000715679(PQKBManifestationID)11400822(PQKBTitleCode)TC0000715679(PQKBWorkID)10703644(PQKB)21402008(DE-He213)978-3-540-49494-2(MiAaPQ)EBC3088465(MiAaPQ)EBC6485658(PPN)155196359(EXLCZ)99100000000021101620210714d1998 uy 0engurnn#008mamaatxtccrGraph-theoretic concepts in computer science 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings /edited by Juraj Hromkovič; Ondrej Sýkora1st ed. 1998.Berlin, Germany ;New York, New York :Springer,[1998]©19981 online resource (X, 394 p.)Lecture notes in computer science ;Volume 1517Bibliographic Level Mode of Issuance: Monograph3-540-65195-0 Includes bibliographical references at the end of each chapters and index.Linear 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.Lecture notes in computer science ;Volume 1517.Electronic data processingCongressesGraph theoryCongressesElectronic data processingGraph theory004.0151Sýkora OndrejHromkovič Juraj1958-MiAaPQMiAaPQUtOrBLWBOOK996466109503316Graph-Theoretic Concepts in Computer Science2569248UNISA