<p>During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied t
Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers (Lecture Notes in Computer Science, 3353)
✍ Scribed by Juraj Hromkovič (editor), Manfred Nagl (editor), Bernhard Westfechtel (editor)
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Leaves
- 421
- Edition
- 2005
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.
✦ Table of Contents
Table of Contents
Invited Papers
Lexicographic Breadth First Search – A Survey
Wireless Networking: Graph Theory Unplugged
Graph Algorithms: Trees
Constant Time Generation of Trees with Specified Diameter
Treelike Comparability Graphs: Characterization, Recognition, and Applications
Elegant Distance Constrained Labelings of Trees
Collective Tree Spanners and Routing in AT-free Related Graphs
Graph Algorithms: Recognition and Decomposition
On the Maximum Cardinality Search Lower Bound for Treewidth
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
Recognizing HHD-free and Welsh-Powell Opposition Graphs
Bimodular Decomposition of Bipartite Graphs
Coloring a Graph Using Split Decomposition
Graph Algorithms: Various Problems
Decremental Clique Problem
A Symbolic Approach to the All-Pairs Shortest-Paths Problem
Minimal de Bruijn Sequence in a Language with Forbidden Substrings
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic εL
Optimization and Approximation Algorithms
The Computational Complexity of the Minimum Weight Processor Assignment Problem
A Stochastic Location Problem with Applications to Tele-diagnostic
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
Tolerance Based Algorithms for the ATSP
Parameterized Complexity and Exponential Algorithms
Finding k Disjoint Triangles in an Arbitrary Graph
Exact (Exponential) Algorithms for the Dominating Set Problem
Linear Kernels in Linear Time, or How to Save k Colors in O(n[sup(2)]) Steps
Counting, Combinatorics, and Optimization
Planar Graphs, via Well-Orderly Maps and Trees
Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
Applications (Biology, Graph Drawing)
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
Octagonal Drawings of Plane Graphs with Prescribed Face Areas
Crossing Reduction in Circular Layouts
Graph Classes and NP Hardness
Characterization and Recognition of Generalized Clique-Helly Graphs
Edge-Connectivity Augmentation and Network Matrices
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small
Core Stability of Minimum Coloring Games
Author Index
A
B
C
D
F
G
H
I
J
K
L
M
N
O
P
R
S
T
U
V
W
Y
Z
📜 SIMILAR VOLUMES
<p>The 33rd International Conference “Workshop on Graph-Theoretic Concepts in Computer Science” (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21–23,2007.Theapproximately80 participants came from various countries all over the world, among them Brazil, Cana
<span>The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The workshop was organized by the Algorithms Research Group at the Department of Informatics, University of Bergen,
<span>The 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) was held on the campus "Ile du Saulcy" of the Univ- sity Paul Verlaine-Metz in France. The workshop was organized by the La- ratoire d'Informatique Th´ eorique et Appliqu´ ee (LITA) and it took place June
<span>The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15{ 17 June 2000. It was organized by the Algorithms and Data Structures Group of the Department of Computer and Information Science, University of K-