+612 9045 4394
Graph-Theoretic Concepts in Computer Science : 24th International Workshop, Wg'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings - Juraj Hromkovic

Graph-Theoretic Concepts in Computer Science

24th International Workshop, Wg'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings

By: Juraj Hromkovic (Editor), Ondrej Sykora (Editor)

Paperback Published: 14th October 1998
ISBN: 9783540651956
Number Of Pages: 394

Share This Book:


or 4 easy payments of $33.88 with Learn more
Ships in 5 to 9 business days

The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. PreviousconferenceswereorganizedatvariousplacesinAustria, Germany, Italy, and the Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The workshop is well-balanced with respect to established researchers and young scientists. th The24 InternationalWorkshoponGraph-TheoreticConceptsinComputer Science(WG'98)washeldatSmoleniceCastle, nearBratislava, SlovakRepublic, June 18-20, 1998. It was organized by the Slovak Academy of Computer Science in cooperation with the Department of Computer Science I at RWTH Aachen (Germany) and with Slovak Society for Computer Science. For the ?rst time in its history, WG took place in a country of the former eastern block, in the Slovak Republic. The program committee of WG'98 consisted of: H. Bodlaender, Utrecht (NL) A. Brandst] adt, Rostock (D) M. Habib, Montpellier (F) J. Hromkovi? c, Aachen (D) L. Kirousis, Patras (GR) L. Ku? cera, Praha (CR) A. Marchetti-Spaccamela, Roma (I) E. Mayr, Munc ] hen (D) R. Moehring, Berlin (D) M. Nagl, Aachen (D) H. Noltemeier, Wurzburg ] (D) F. Parisi Presicce, Roma (I) O. Syk ยด ora, Bratislava (SK) G. Tinhofer, Munc ] hen (D) D. Wagner, Konstanz (D) P.

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Widthp. 1
Minus Domination in Small-Degree Graphsp. 17
The Vertex-Disjoint Triangles Problemp. 26
Communication in the Two-Way Listen-in Vertex-disjoint Paths Modep. 38
Broadcasting on Anonymous Unoriented Torip. 50
Families of Graphs Having Broadcasting and Gossiping Propertiesp. 63
Optical All-to-All Communication in Inflated Networksp. 78
A Generalization of AT-free Graphs and a Generic Algorithm for Sol- ving Treewidth, Minimum Fill-In and Vertex Rankingp. 88
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Treesp. 100
Rankings of Directed Graphsp. 114
Drawing Planar Partitions II: HH-Drawingsp. 124
Triangles in Euclidean Arrangementsp. 137
Internally Typed Second-OrderTerm Graphsp. 149
Compact Implicit Representation of Graphsp. 164
Graphs with Bounded Induced Distancep. 177
Diameter Determination on Restricted Graph Familiesp. 192
Independent Tree Spannersp. 203
Upgrading Bottleneck Constrained Forestsp. 215
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decompositionp. 227
Improved Compressions of Cube-Connected Cycles Networksp. 242
Efficient Embeddings of Grids into Gridsp. 257
Integral Uniform Flows in Symmetric Networksp. 272
Splitting Number is NP-completep. 285
Tree Spanners in Planar Graphsp. 298
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphsp. 310
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Basesp. 324
Domination and Steiner Tree Problems on Graphs with Few P4sp. 337
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphsp. 351
Interval Completion with the Smallest Max-degreep. 359
An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minorp. 372
Author Indexp. 385
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540651956
ISBN-10: 3540651950
Series: Lecture Notes in Computer Science,
Audience: General
Format: Paperback
Language: English
Number Of Pages: 394
Published: 14th October 1998
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.11
Weight (kg): 0.56