Graph-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ýkora

• Pubblicazione: Berlin, Germany ; ; New York, New York : , : Springer, , [1998]; ©1998
• Edizione: 1st ed. 1998.
• Descrizione fisica: 1 online resource (X, 394 p.)
• Disciplina: 004.0151
• Soggetto topico: Electronic data processing; Graph theory
• Persona (resp. second.): SýkoraOndrej; HromkovicÌŒJuraj <1958->
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references at the end of each chapters and index.
• Nota di contenuto: 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.
• Titolo autorizzato: Graph-Theoretic Concepts in Computer Science
• ISBN: 3-540-49494-4
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996466109503316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture notes in computer science ; ; Volume 1517.