The 18th International Workshop on Graph-Theoretic Conceptsin Computer Science (WG '92) was held inWiesbaden-Naurod, Germany, June 18-20, 1992. Itwasorganized by the Department of Computer Science, JohannWolfgang Goethe University, Frankfurt am Main.Contributions with original results inthe study andapplication of graph-theoretic concepts in various fields ofcomputer science were solicited, and 72 papers weresubmitted and reviewed, from which 29 were selected forpresentation at the workshop. The workshop was attended by61 scientists from 16 countries. All 29 papers in thevolume have undergone careful revision after the meeting,based on the discussions and comments from the audience andthe referees.The volume is divided into parts on restricted graphclasses, scheduling and related problems, parallel anbddistributed algorithms, combinatorial graph problems, graphdecomposition, graph grammars and geometry, and modelling bygraphs.
On improved time bounds for permutation graph problems.- A simple test for interval graphs.- Tolerance graphs and orders.- On scheduling problems restricted to interval orders.- Scheduling with incompatible jobs.- Generalized coloring for tree-like graphs.- Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes.- Topology of parallel networks and computational complexity (extended abstract).- Parallel triangulation of nonconvex polytopes.- Kayles on special classes of graphs - An application of Sprague-Grundy theory.- A linear time algorithm for isomorphism of graphs of bounded average genus.- Improved algorithms for routing on two-dimensional grids.- Minimum rectilinear steiner trees for intervals on two parallel lines.- A new characterization of tree medians with applications to distributed algorithms.- The 3-edge-components and a structural description of all 3-edge-cuts in a graph.- On assembly of four-connected graphs.- On the homogeneous decomposition of graphs.- Embeddings in recursive combinatorial networks.- On shortcutting digraphs.- An efficient algorithm to recognize prime undirected graphs.- On the complexity of partial order properties.- Probabilistic graph grammars.- Single vs. double pushout derivations of graphs.- Hexagonal grid drawings.- Graph algorithms = iteration + data structures?.- Petri nets, hypergraphs and conflicts (preliminary version).- Analysis and manipulation of Boolean functions in terms of decision graphs.- The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence.- The power and the limitations of local computations on graphs.
Series: Lecture Notes in Computer Science
Number Of Pages: 355
Published: 26th February 1993
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6
Weight (kg): 0.51