Graph-Theoretic Concepts in Computer Science: 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings (Lecture Notes in Computer Science, 1517, Band 1517) - Softcover

Sykora, Ondrej; Hromkovic, Juraj

 
9783540651956: Graph-Theoretic Concepts in Computer Science: 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings (Lecture Notes in Computer Science, 1517, Band 1517)

Inhaltsangabe

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..

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Weitere beliebte Ausgaben desselben Titels

9783540806240: Graph-Theoretic Concepts in Computer Science

Vorgestellte Ausgabe

ISBN 10:  3540806245 ISBN 13:  9783540806240
Verlag: Springer, 2008
Softcover